Stopping Rules for Optimization Algorithms Based on Stochastic Approximation
Takayuki Wada () and
Yasumasa Fujisaki ()
Additional contact information
Takayuki Wada: Osaka University
Yasumasa Fujisaki: Osaka University
Journal of Optimization Theory and Applications, 2016, vol. 169, issue 2, No 11, 568-586
Abstract:
Abstract Stopping rules are developed for stochastic optimization algorithms, which minimize an unknown objective function using noise corrupted measurements. In particular, the finite-difference stochastic approximation and the simultaneous perturbation stochastic approximation are considered. The candidate solution after an adequate number of iterations is shown to be sufficiently close to the optimal solution in a mean squared sense. These numbers are determined by a priori information only. Furthermore, it is shown that these are polynomial order of the problem size.
Keywords: Stochastic approximation; Stochastic optimization; Stopping rule; 62L20; 90C99 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1007/s10957-015-0808-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:169:y:2016:i:2:d:10.1007_s10957-015-0808-7
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1007/s10957-015-0808-7
Access Statistics for this article
Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull
More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().