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

Optimality Functions and Lopsided Convergence

Author

Listed:
  • Johannes O. Royset

    (Naval Postgraduate School)

  • Roger J-B Wets

    (University of California, Davis)

Abstract

Optimality functions pioneered by E. Polak characterize stationary points, quantify the degree with which a point fails to be stationary, and play central roles in algorithm development. For optimization problems requiring approximations, optimality functions can be used to ensure consistency in approximations, with the consequence that optimal and stationary points of the approximate problems indeed are approximately optimal and stationary for an original problem. In this paper, we review the framework and illustrate its application to nonlinear programming and other areas. Moreover, we introduce lopsided convergence of bifunctions on metric spaces and show that this notion of convergence is instrumental in establishing consistency of approximations. Lopsided convergence also leads to further characterizations of stationary points under perturbations and approximations.

Suggested Citation

  • Johannes O. Royset & Roger J-B Wets, 2016. "Optimality Functions and Lopsided Convergence," Journal of Optimization Theory and Applications, Springer, vol. 169(3), pages 965-983, June.
    • Handle: RePEc:spr:joptap:v:169:y:2016:i:3:d:10.1007_s10957-015-0839-0
    DOI: 10.1007/s10957-015-0839-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-015-0839-0
    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-0839-0?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. Johannes Royset, 2013. "On sample size control in sample average approximations for solving smooth stochastic programs," Computational Optimization and Applications, Springer, vol. 55(2), pages 265-309, June.
    2. Raghu Pasupathy, 2010. "On Choosing Parameters in Retrospective-Approximation Algorithms for Stochastic Root Finding and Simulation Optimization," Operations Research, INFORMS, vol. 58(4-part-1), pages 889-901, August.
    3. J. O. Royset & E. Y. Pee, 2012. "Rate of Convergence Analysis of Discretization and Smoothing Algorithms for Semiinfinite Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 155(3), pages 855-882, December.
    4. Johannes O. Royset & Roberto Szechtman, 2013. "Optimal Budget Allocation for Sample Average Approximation," Operations Research, INFORMS, vol. 61(3), pages 762-776, June.
    Full references (including those not matched with items on IDEAS)

    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. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    2. Suvrajeet Sen & Yifan Liu, 2016. "Mitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction," Operations Research, INFORMS, vol. 64(6), pages 1422-1437, December.
    3. Kyle Cooper & Susan R. Hunter & Kalyani Nagaraj, 2020. "Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1080-1100, October.
    4. Hu, Shaolong & Hu, Qingmi & Tao, Sha & Dong, Zhijie Sasha, 2023. "A multi-stage stochastic programming approach for pre-positioning of relief supplies considering returns," Socio-Economic Planning Sciences, Elsevier, vol. 88(C).
    5. Bismark Singh & David P. Morton & Surya Santoso, 2018. "An adaptive model with joint chance constraints for a hybrid wind-conventional generator system," Computational Management Science, Springer, vol. 15(3), pages 563-582, October.
    6. Yan, Pengyu & Yu, Kaize & Chao, Xiuli & Chen, Zhibin, 2023. "An online reinforcement learning approach to charging and order-dispatching optimization for an e-hailing electric vehicle fleet," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1218-1233.
    7. Wang, Honggang, 2012. "Retrospective optimization of mixed-integer stochastic systems using dynamic simplex linear interpolation," European Journal of Operational Research, Elsevier, vol. 217(1), pages 141-148.
    8. J. O. Royset & E. Y. Pee, 2012. "Rate of Convergence Analysis of Discretization and Smoothing Algorithms for Semiinfinite Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 155(3), pages 855-882, December.
    9. Xiang He & Xiqun (Michael) Chen & Chenfeng Xiong & Zheng Zhu & Lei Zhang, 2017. "Optimal Time-Varying Pricing for Toll Roads Under Multiple Objectives: A Simulation-Based Optimization Approach," Transportation Science, INFORMS, vol. 51(2), pages 412-426, May.
    10. Yunxiao Deng & Suvrajeet Sen, 2022. "Predictive stochastic programming," Computational Management Science, Springer, vol. 19(1), pages 65-98, January.
    11. Johannes O. Royset & Roberto Szechtman, 2013. "Optimal Budget Allocation for Sample Average Approximation," Operations Research, INFORMS, vol. 61(3), pages 762-776, June.
    12. Anand Deo & Karthyek Murthy, 2023. "Importance Sampling for Minimization of Tail Risks: A Tutorial," Papers 2307.04676, arXiv.org.
    13. Stefania Bellavia & Nataša Krejić & Benedetta Morini, 2020. "Inexact restoration with subsampled trust-region methods for finite-sum minimization," Computational Optimization and Applications, Springer, vol. 76(3), pages 701-736, July.
    14. Nataša Krejić & Nataša Krklec Jerinkić, 2019. "Spectral projected gradient method for stochastic optimization," Journal of Global Optimization, Springer, vol. 73(1), pages 59-81, January.
    15. Jin-bao Jian & Qing-juan Hu & Chun-ming Tang, 2014. "Superlinearly Convergent Norm-Relaxed SQP Method Based on Active Set Identification and New Line Search for Constrained Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 859-883, December.
    16. Johannes Royset, 2013. "On sample size control in sample average approximations for solving smooth stochastic programs," Computational Optimization and Applications, Springer, vol. 55(2), pages 265-309, June.
    17. Junxiang Li & Mingsong Cheng & Bo Yu & Shuting Zhang, 2015. "Group Update Method for Sparse Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 257-277, July.
    18. Honggang Wang, 2017. "Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(4), pages 305-322, June.
    19. Tsai, Shing Chih & Zheng, Ya-Xin, 2013. "A simulation optimization approach for a two-echelon inventory system with service level constraints," European Journal of Operational Research, Elsevier, vol. 229(2), pages 364-374.
    20. Jamie Fairbrother & Amanda Turner & Stein W. Wallace, 2018. "Scenario Generation for Single-Period Portfolio Selection Problems with Tail Risk Measures: Coping with High Dimensions and Integer Variables," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 472-491, August.

    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:3:d:10.1007_s10957-015-0839-0. 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.