Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/18354
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Krejić Nataša | - |
dc.contributor.author | Luzanin Zorana | - |
dc.contributor.author | Ovcin Zoran | - |
dc.contributor.author | Stojkovska I. | - |
dc.date.accessioned | 2020-12-13T12:39:53Z | - |
dc.date.available | 2020-12-13T12:39:53Z | - |
dc.date.issued | 2015 | - |
dc.identifier.issn | 1055-6788 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/18354 | - |
dc.description.abstract | © 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. | - |
dc.language.iso | en | - |
dc.relation.ispartof | Optimization Methods and Software | - |
dc.source | CRIS UNS | - |
dc.source.uri | http://cris.uns.ac.rs | - |
dc.title | Descent direction method with line search for unconstrained optimization in noisy environment | - |
dc.type | Journal/Magazine Article | - |
dc.identifier.doi | 10.1080/10556788.2015.1025403 | - |
dc.identifier.scopus | 2-s2.0-84942372902 | - |
dc.identifier.url | https://www.cris.uns.ac.rs/record.jsf?recordId=106301&source=BEOPEN&language=en | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84942372902 | - |
dc.relation.lastpage | 1184 | - |
dc.relation.firstpage | 1164 | - |
dc.relation.issue | 6 | - |
dc.relation.volume | 30 | - |
dc.identifier.externalcrisreference | (BISIS)106301 | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.dept | Fakultet tehničkih nauka, Departman za opšte discipline u tehnici | - |
crisitem.author.orcid | 0000-0003-3348-7233 | - |
crisitem.author.orcid | 0000-0002-7215-2252 | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
crisitem.author.parentorg | Fakultet tehničkih nauka | - |
Appears in Collections: | PMF Publikacije/Publications |
SCOPUSTM
Citations
10
checked on Aug 12, 2023
Page view(s)
28
Last Week
7
7
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.