Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/18354
Nаziv: | Descent direction method with line search for unconstrained optimization in noisy environment | Аutоri: | Krejić Nataša Luzanin Zorana Ovcin Zoran Stojkovska I. |
Dаtum izdаvаnjа: | 2015 | Čаsоpis: | Optimization Methods and Software | Sažetak: | © 2015 Taylor & Francis. A two-phase descent direction method for unconstrained stochastic optimization problem is proposed. A line-search method with an arbitrary descent direction is used to determine the step sizes during the initial phase, and the second phase performs the stochastic approximation (SA) step sizes. The almost sure convergence of the proposed method is established, under standard assumption for descent direction and SA methods. The algorithm used for practical implementation combines a line-search quasi-Newton (QN) method, in particular the Broyden-Fletcher-Goldfarb-Shanno (BFGS) and Symmetric Rank 1 (SR1) methods, with the SA iterations. Numerical results show good performance of the proposed method for different noise levels. | URI: | https://open.uns.ac.rs/handle/123456789/18354 | ISSN: | 1055-6788 | DOI: | 10.1080/10556788.2015.1025403 |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
10
prоvеrеnо 12.08.2023.
Prеglеd/i stаnicа
28
Prоtеklа nеdеljа
7
7
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.