IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v169y2016i2d10.1007_s10957-015-0808-7.html
   My bibliography  Save this article

Stopping Rules for Optimization Algorithms Based on Stochastic Approximation

Author

Listed:
  • Takayuki Wada

    (Osaka University)

  • Yasumasa Fujisaki

    (Osaka University)

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.

Suggested Citation

  • Takayuki Wada & Yasumasa Fujisaki, 2016. "Stopping Rules for Optimization Algorithms Based on Stochastic Approximation," Journal of Optimization Theory and Applications, Springer, vol. 169(2), pages 568-586, May.
    • Handle: RePEc:spr:joptap:v:169:y:2016:i:2:d:10.1007_s10957-015-0808-7
    DOI: 10.1007/s10957-015-0808-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-015-0808-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-015-0808-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Mark Broadie & Deniz Cicek & Assaf Zeevi, 2011. "General Bounds and Finite-Time Improvement for the Kiefer-Wolfowitz Stochastic Approximation Algorithm," Operations Research, INFORMS, vol. 59(5), pages 1211-1224, October.
    2. G. Yin & J. W. Wang & Q. Zhang & Y. J. Liu, 2006. "Stochastic Optimization Algorithms for Pricing American Put Options Under Regime-Switching Models," Journal of Optimization Theory and Applications, Springer, vol. 131(1), pages 37-52, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Miloje S. Radenković & Miloš S. Stanković & Srdjan S. Stanković, 2018. "On Stochastic Extremum Seeking via Adaptive Perturbation–Demodulation Loop," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 1008-1024, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Thomas Loots & Arnoud V. den Boer, 2023. "Data‐driven collusion and competition in a pricing duopoly with multinomial logit demand," Production and Operations Management, Production and Operations Management Society, vol. 32(4), pages 1169-1186, April.
    2. Josef Broder & Paat Rusmevichientong, 2012. "Dynamic Pricing Under a General Parametric Choice Model," Operations Research, INFORMS, vol. 60(4), pages 965-980, August.
    3. Boxiao Chen & Xiuli Chao & Cong Shi, 2021. "Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 726-756, May.
    4. Kim, Sojung & Weber, Stefan, 2022. "Simulation methods for robust risk assessment and the distorted mix approach," European Journal of Operational Research, Elsevier, vol. 298(1), pages 380-398.
    5. Sojung Kim & Stefan Weber, 2020. "Simulation Methods for Robust Risk Assessment and the Distorted Mix Approach," Papers 2009.03653, arXiv.org, revised Jan 2022.
    6. Steven Kou & Xianhua Peng & Xingbo Xu, 2016. "EM Algorithm and Stochastic Control in Economics," Papers 1611.01767, arXiv.org.
    7. Arel-Bundock, Vincent, 2013. "A solution to the weak instrument bias in 2SLS estimation: Indirect inference with stochastic approximation," Economics Letters, Elsevier, vol. 120(3), pages 495-498.
    8. Yanwei Jia, 2024. "Continuous-time Risk-sensitive Reinforcement Learning via Quadratic Variation Penalty," Papers 2404.12598, arXiv.org.
    9. Adam W. Kolkiewicz & Fangyuan Sally Lin, 2017. "Pricing Surrender Risk in Ratchet Equity-Index Annuities under Regime-Switching Lévy Processes," North American Actuarial Journal, Taylor & Francis Journals, vol. 21(3), pages 433-457, July.
    10. Ye Chen & Ilya O. Ryzhov, 2020. "Technical Note—Consistency Analysis of Sequential Learning Under Approximate Bayesian Inference," Operations Research, INFORMS, vol. 68(1), pages 295-307, January.
    11. Yang, Xiangyu & Zhang, Jianghua & Hu, Jian-Qiang & Hu, Jiaqiao, 2024. "Nonparametric multi-product dynamic pricing with demand learning via simultaneous price perturbation," European Journal of Operational Research, Elsevier, vol. 319(1), pages 191-205.
    12. Zhaolin Hu & Dali Zhang, 2018. "Utility‐based shortfall risk: Efficient computations via Monte Carlo," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(5), pages 378-392, August.
    13. Powell, Warren B., 2019. "A unified framework for stochastic optimization," European Journal of Operational Research, Elsevier, vol. 275(3), pages 795-821.
    14. Aleksandrina Goeva & Henry Lam & Huajie Qian & Bo Zhang, 2019. "Optimization-Based Calibration of Simulation Input Models," Operations Research, INFORMS, vol. 67(5), pages 1362-1382, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:169:y:2016:i:2:d:10.1007_s10957-015-0808-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.