IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v72y2019i2d10.1007_s10589-018-0048-5.html
   My bibliography  Save this article

A simple version of bundle method with linear programming

Author

Listed:
  • Shuai Liu

    (IMECC/UNICAMP)

Abstract

Bundle methods have been well studied in nonsmooth optimization. In most of the bundle methods developed thus far (traditional bundle methods), at least one quadratic programming subproblem needs to be solved in each iteration. In this paper, a simple version of bundle method with linear programming is proposed. In each iteration, a cutting-plane model subject to a constraint constructed by an infinity norm is minimized. Without line search or trust region techniques, the convergence of the method can be shown. Additionally, the infinity norm in the constraint can be generalized to $$p$$ p -norm. Preliminary numerical experiments show the potential advantage of the proposed method for solving large scale problems.

Suggested Citation

  • Shuai Liu, 2019. "A simple version of bundle method with linear programming," Computational Optimization and Applications, Springer, vol. 72(2), pages 391-412, March.
    • Handle: RePEc:spr:coopap:v:72:y:2019:i:2:d:10.1007_s10589-018-0048-5
    DOI: 10.1007/s10589-018-0048-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-018-0048-5
    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/s10589-018-0048-5?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. W. Ackooij & A. Frangioni & W. Oliveira, 2016. "Inexact stabilized Benders’ decomposition approaches with application to chance-constrained problems with finite support," Computational Optimization and Applications, Springer, vol. 65(3), pages 637-669, December.
    2. M. V. Solodov, 2003. "On Approximations with Finite Precision in Bundle Methods for Nonsmooth Optimization," Journal of Optimization Theory and Applications, Springer, vol. 119(1), pages 151-165, October.
    3. A. M. Bagirov & B. Karasözen & M. Sezer, 2008. "Discrete Gradient Method: Derivative-Free Method for Nonsmooth Optimization," Journal of Optimization Theory and Applications, Springer, vol. 137(2), pages 317-334, May.
    4. R. Andreani & J. M. Martinez & M. L. Schuverdt, 2005. "On the Relation between Constant Positive Linear Dependence Condition and Quasinormality Constraint Qualification," Journal of Optimization Theory and Applications, Springer, vol. 125(2), pages 473-483, May.
    5. W. Hare & C. Sagastizábal & M. Solodov, 2016. "A proximal bundle method for nonsmooth nonconvex functions with inexact information," Computational Optimization and Applications, Springer, vol. 63(1), pages 1-28, January.
    6. 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).
    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. 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).

    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. Fan-Yun Meng & Li-Ping Pang & Jian Lv & Jin-He Wang, 2017. "An approximate bundle method for solving nonsmooth equilibrium problems," Journal of Global Optimization, Springer, vol. 68(3), pages 537-562, July.
    2. Welington Oliveira, 2019. "Proximal bundle methods for nonsmooth DC programming," Journal of Global Optimization, Springer, vol. 75(2), pages 523-563, October.
    3. W. Ackooij & S. Demassey & P. Javal & H. Morais & W. Oliveira & B. Swaminathan, 2021. "A bundle method for nonsmooth DC programming with application to chance-constrained problems," Computational Optimization and Applications, Springer, vol. 78(2), pages 451-490, March.
    4. Xiaoliang Wang & Liping Pang & Qi Wu & Mingkun Zhang, 2021. "An Adaptive Proximal Bundle Method with Inexact Oracles for a Class of Nonconvex and Nonsmooth Composite Optimization," Mathematics, MDPI, vol. 9(8), pages 1-27, April.
    5. Wim Ackooij & Welington Oliveira, 2019. "Nonsmooth and Nonconvex Optimization via Approximate Difference-of-Convex Decompositions," Journal of Optimization Theory and Applications, Springer, vol. 182(1), pages 49-80, July.
    6. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2020. "Essentials of numerical nonsmooth optimization," 4OR, Springer, vol. 18(1), pages 1-47, March.
    7. Wim Ackooij & Welington Oliveira & Yongjia Song, 2019. "On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems," Computational Optimization and Applications, Springer, vol. 74(1), pages 1-42, September.
    8. 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).
    9. Jian Lv & Li-Ping Pang & Fan-Yun Meng, 2018. "A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information," Journal of Global Optimization, Springer, vol. 70(3), pages 517-549, March.
    10. N. Hoseini Monjezi & S. Nobakhtian, 2022. "An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems," Annals of Operations Research, Springer, vol. 311(2), pages 1123-1154, April.
    11. L. F. Bueno & G. Haeser & J. M. Martínez, 2015. "A Flexible Inexact-Restoration Method for Constrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 165(1), pages 188-208, April.
    12. Kuang Bai & Yixia Song & Jin Zhang, 2023. "Second-Order Enhanced Optimality Conditions and Constraint Qualifications," Journal of Optimization Theory and Applications, Springer, vol. 198(3), pages 1264-1284, September.
    13. Chungen Shen & Lei-Hong Zhang & Wei Liu, 2016. "A stabilized filter SQP algorithm for nonlinear programming," Journal of Global Optimization, Springer, vol. 65(4), pages 677-708, August.
    14. Adil M. Bagirov & Julien Ugon & Hijran G. Mirzayeva, 2015. "Nonsmooth Optimization Algorithm for Solving Clusterwise Linear Regression Problems," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 755-780, March.
    15. Leonid Minchenko, 2019. "Note on Mangasarian–Fromovitz-Like Constraint Qualifications," Journal of Optimization Theory and Applications, Springer, vol. 182(3), pages 1199-1204, September.
    16. David E. Bernal & Zedong Peng & Jan Kronqvist & Ignacio E. Grossmann, 2022. "Alternative regularizations for Outer-Approximation algorithms for convex MINLP," Journal of Global Optimization, Springer, vol. 84(4), pages 807-842, December.
    17. 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.
    18. L. Minchenko & A. Tarakanov, 2011. "On Error Bounds for Quasinormal Programs," Journal of Optimization Theory and Applications, Springer, vol. 148(3), pages 571-579, March.
    19. Daniel Baena & Jordi Castro & Antonio Frangioni, 2020. "Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy," Management Science, INFORMS, vol. 66(7), pages 3051-3068, July.
    20. Nguyen Huy Chieu & Gue Myung Lee, 2014. "Constraint Qualifications for Mathematical Programs with Equilibrium Constraints and their Local Preservation Property," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 755-776, December.

    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:coopap:v:72:y:2019:i:2:d:10.1007_s10589-018-0048-5. 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.