IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i2p265-d321548.html
   My bibliography  Save this article

Modified Accelerated Bundle-Level Methods and Their Application in Two-Stage Stochastic Programming

Author

Listed:
  • Chunming Tang

    (College of Mathematics and Information Science, Guangxi University, Nanning 540004, China)

  • Bo He

    (College of Mathematics and Information Science, Guangxi University, Nanning 540004, China)

  • Zhenzhen Wang

    (College of Mathematics and Information Science, Guangxi University, Nanning 540004, China)

Abstract

The accelerated prox-level (APL) and uniform smoothing level (USL) methods recently proposed by Lan (Math Program, 149: 1–45, 2015) can achieve uniformly optimal complexity when solving black-box convex programming (CP) and structure non-smooth CP problems. In this paper, we propose two modified accelerated bundle-level type methods, namely, the modified APL (MAPL) and modified USL (MUSL) methods. Compared with the original APL and USL methods, the MAPL and MUSL methods reduce the number of subproblems by one in each iteration, thereby improving the efficiency of the algorithms. Conclusions of optimal iteration complexity of the proposed algorithms are established. Furthermore, the modified methods are applied to the two-stage stochastic programming, and numerical experiments are implemented to illustrate the advantages of our methods in terms of efficiency and accuracy.

Suggested Citation

  • Chunming Tang & Bo He & Zhenzhen Wang, 2020. "Modified Accelerated Bundle-Level Methods and Their Application in Two-Stage Stochastic Programming," Mathematics, MDPI, vol. 8(2), pages 1-26, February.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:2:p:265-:d:321548
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/2/265/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/2/265/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Arthur F. Veinott, 1967. "The Supporting Hyperplane Method for Unimodal Programming," Operations Research, INFORMS, vol. 15(1), pages 147-152, February.
    2. Yang, Linfeng & Zhang, Chen & Jian, Jinbao & Meng, Ke & Xu, Yan & Dong, Zhaoyang, 2017. "A novel projected two-binary-variable formulation for unit commitment in power systems," Applied Energy, Elsevier, vol. 187(C), pages 732-745.
    3. Yunmei Chen & Guanghui Lan & Yuyuan Ouyang & Wei Zhang, 2019. "Fast bundle-level methods for unconstrained and ball-constrained convex optimization," Computational Optimization and Applications, Springer, vol. 73(1), pages 159-199, May.
    4. Jeff Linderoth & Alexander Shapiro & Stephen Wright, 2006. "The empirical behavior of sampling methods for stochastic programming," Annals of Operations Research, Springer, vol. 142(1), pages 215-241, February.
    5. Lemaréchal, C. & Nemirovskii, A. & Nesterov, Y., 1995. "New variants of bundle methods," LIDAM Reprints CORE 1166, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. NESTEROV, Yu., 2005. "Smooth minimization of non-smooth functions," LIDAM Reprints CORE 1819, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Yunmei Chen & Xiaojing Ye & Wei Zhang, 2020. "Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization," Computational Optimization and Applications, Springer, vol. 77(2), pages 411-432, November.
    2. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2020. "Essentials of numerical nonsmooth optimization," 4OR, Springer, vol. 18(1), pages 1-47, March.
    3. Wim van Ackooij & Welington de Oliveira & Yongjia Song, 2018. "Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 57-70, February.
    4. Arkadi Nemirovski & Shmuel Onn & Uriel G. Rothblum, 2010. "Accuracy Certificates for Computational Problems with Convex Structure," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 52-78, February.
    5. Tang, Chunming & Liu, Shuai & Jian, Jinbao & Ou, Xiaomei, 2020. "A multi-step doubly stabilized bundle method for nonsmooth convex optimization," Applied Mathematics and Computation, Elsevier, vol. 376(C).
    6. Blanchot, Xavier & Clautiaux, François & Detienne, Boris & Froger, Aurélien & Ruiz, Manuel, 2023. "The Benders by batch algorithm: Design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 309(1), pages 202-216.
    7. Mikhail A. Bragin & Peter B. Luh & Joseph H. Yan & Nanpeng Yu & Gary A. Stern, 2015. "Convergence of the Surrogate Lagrangian Relaxation Method," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 173-201, January.
    8. Michael Freimer & Jeffrey Linderoth & Douglas Thomas, 2012. "The impact of sampling methods on bias and variance in stochastic linear programs," Computational Optimization and Applications, Springer, vol. 51(1), pages 51-75, January.
    9. Luis Montero & Antonio Bello & Javier Reneses, 2022. "A Review on the Unit Commitment Problem: Approaches, Techniques, and Resolution Methods," Energies, MDPI, vol. 15(4), pages 1-40, February.
    10. Zéphyr, Luckny & Lang, Pascal & Lamond, Bernard F. & Côté, Pascal, 2017. "Approximate stochastic dynamic programming for hydroelectric production planning," European Journal of Operational Research, Elsevier, vol. 262(2), pages 586-601.
    11. Alexandre Forel & Martin Grunow, 2023. "Dynamic stochastic lot sizing with forecast evolution in rolling‐horizon planning," Production and Operations Management, Production and Operations Management Society, vol. 32(2), pages 449-468, February.
    12. Chen, Lijian, 2020. "Determine the cost of denying boarding to passengers: An optimization-based approach," International Journal of Production Economics, Elsevier, vol. 220(C).
    13. Yang, Linfeng & Li, Wei & Xu, Yan & Zhang, Cuo & Chen, Shifei, 2021. "Two novel locally ideal three-period unit commitment formulations in power systems," Applied Energy, Elsevier, vol. 284(C).
    14. Güzin Bayraksan & David P. Morton, 2011. "A Sequential Sampling Procedure for Stochastic Programming," Operations Research, INFORMS, vol. 59(4), pages 898-913, August.
    15. Dirk Lorenz & Marc Pfetsch & Andreas Tillmann, 2014. "An infeasible-point subgradient method using adaptive approximate projections," Computational Optimization and Applications, Springer, vol. 57(2), pages 271-306, March.
    16. 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.
    17. Xiaotie Chen & David L. Woodruff, 2024. "Distributions and bootstrap for data-based stochastic programming," Computational Management Science, Springer, vol. 21(1), pages 1-21, June.
    18. Miao Bai & Bjorn Berg & Esra Sisikoglu Sir & Mustafa Y. Sir, 2023. "Partially partitioned templating strategies for outpatient specialty practices," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 301-318, January.
    19. Jueyou Li & Zhiyou Wu & Changzhi Wu & Qiang Long & Xiangyu Wang, 2016. "An Inexact Dual Fast Gradient-Projection Method for Separable Convex Optimization with Linear Coupled Constraints," Journal of Optimization Theory and Applications, Springer, vol. 168(1), pages 153-171, January.
    20. Guoyin Li & Alfred Ma & Ting Pong, 2014. "Robust least square semidefinite programming with applications," Computational Optimization and Applications, Springer, vol. 58(2), pages 347-379, June.

    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:gam:jmathe:v:8:y:2020:i:2:p:265-:d:321548. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.