IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v49y2024i2p832-855.html

A Unified Analysis of a Class of Proximal Bundle Methods for Solving Hybrid Convex Composite Optimization Problems

Author

Listed:
  • Jiaming Liang

    (Department of Computer Science, Yale University, New Haven, Connecticut 06511)

  • Renato D. C. Monteiro

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

Abstract

This paper presents a proximal bundle (PB) framework based on a generic bundle update scheme for solving the hybrid convex composite optimization (HCCO) problem and establishes a common iteration-complexity bound for any variant belonging to it. As a consequence, iteration-complexity bounds for three PB variants based on different bundle update schemes are obtained in the HCCO context for the first time and in a unified manner. Although two of the PB variants are universal (i.e., their implementations do not require parameters associated with the HCCO instance), the other newly (as far as the authors are aware) proposed one is not, but has the advantage that it generates simple—namely, one-cut—bundle models. The paper also presents a universal adaptive PB variant (which is not necessarily an instance of the framework) based on one-cut models and shows that its iteration-complexity is the same as the two aforementioned universal PB variants.

Suggested Citation

  • Jiaming Liang & Renato D. C. Monteiro, 2024. "A Unified Analysis of a Class of Proximal Bundle Methods for Solving Hybrid Convex Composite Optimization Problems," Mathematics of Operations Research, INFORMS, vol. 49(2), pages 832-855, May.
    • Handle: RePEc:inm:ormoor:v:49:y:2024:i:2:p:832-855
    DOI: 10.1287/moor.2023.1372
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2023.1372
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2023.1372?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
    ---><---

    References listed on IDEAS

    as
    1. K. C. Kiwiel, 2000. "Efficiency of Proximal Bundle Methods," Journal of Optimization Theory and Applications, Springer, vol. 104(3), pages 589-603, March.
    2. 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. Vincent Guigues & Jiaming Liang & Renato D. C. Monteiro, 2026. "Universal Subgradient and Proximal Bundle Methods for Convex and Strongly Convex Hybrid Composite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 208(3), pages 1-33, March.

    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. Jiaming Liang & Yongxin Chen, 2026. "Proximal Oracles for Optimization and Sampling," Journal of Optimization Theory and Applications, Springer, vol. 208(3), pages 1-34, March.
    2. Benjamin Grimmer, 2023. "General Hölder Smooth Convergence Rates Follow from Specialized Rates Assuming Growth Bounds," Journal of Optimization Theory and Applications, Springer, vol. 197(1), pages 51-70, April.
    3. 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).
    4. Rui Peng Liu & Konstantina Mellou & Evelyn Xiao-Yue Gong & Beibin Li & Thomas Coffee & Jeevan Pathuri & David Simchi-Levi & Ishai Menache, 2025. "Efficient Cloud Server Deployment Under Demand Uncertainty," Manufacturing & Service Operations Management, INFORMS, vol. 27(2), pages 425-440, March.
    5. Feng-Yi Liao & Lijun Ding & Yang Zheng, 2026. "An overview and comparison of spectral bundle methods for primal and dual semidefinite programs," Computational Optimization and Applications, Springer, vol. 93(2), pages 523-566, March.
    6. Krzysztof C. Kiwiel & Torbjörn Larsson & P. O. Lindberg, 2007. "Lagrangian Relaxation via Ballstep Subgradient Methods," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 669-686, August.
    7. Welington Oliveira, 2019. "Proximal bundle methods for nonsmooth DC programming," Journal of Global Optimization, Springer, vol. 75(2), pages 523-563, October.
    8. 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.
    9. 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.
    10. Shuoguang Yang & Xudong Li & Guanghui Lan, 2025. "Data-Driven Minimax Optimization with Expectation Constraints," Operations Research, INFORMS, vol. 73(3), pages 1345-1365, May.
    11. Butyn, Emerson & Karas, Elizabeth W. & de Oliveira, Welington, 2022. "A derivative-free trust-region algorithm with copula-based models for probability maximization problems," European Journal of Operational Research, Elsevier, vol. 298(1), pages 59-75.
    12. Escudero, Laureano F. & Monge, Juan F. & Rodríguez-Chía, Antonio M., 2020. "On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty," European Journal of Operational Research, Elsevier, vol. 287(1), pages 262-279.
    13. Clautiaux, François & Ljubić, Ivana, 2025. "Last fifty years of integer linear programming: A focus on recent practical advances," European Journal of Operational Research, Elsevier, vol. 324(3), pages 707-731.
    14. Caroline Granfeldt & Ann-Brith Strömberg & Lisa Göransson, 2023. "A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(4), pages 1263-1294, December.
    15. A. Fuduli & M. Gaudioso, 2006. "Tuning Strategy for the Proximity Parameter in Convex Minimization," Journal of Optimization Theory and Applications, Springer, vol. 130(1), pages 95-112, July.
    16. Zhang, Miao & Yang, Jingyuan & Zhang, Chuwen & He, Simai & Liu, Huikang & Wang, Jinshen & Wang, Zizhuo, 2025. "An approximate dynamic programming approach for solving aircraft fleet engine maintenance problem: Methodology and a case study," European Journal of Operational Research, Elsevier, vol. 321(3), pages 958-973.
    17. Niloofar Fadavi & Harsha Gangammanavar, 2026. "Active set-based inexact proximal bundle algorithm for stochastic quadratic programming," Computational Optimization and Applications, Springer, vol. 93(2), pages 489-521, March.
    18. Guilherme Mazanti & Thibault Moquet & Laurent Pfeiffer, 2025. "A Nonsmooth Frank–Wolfe Algorithm Through a Dual Cutting-Plane Approach," Journal of Optimization Theory and Applications, Springer, vol. 207(2), pages 1-49, November.
    19. Göke, Leonard & Schmidt, Felix & Kendziorski, Mario, 2024. "Stabilized Benders decomposition for energy planning under climate uncertainty," European Journal of Operational Research, Elsevier, vol. 316(1), pages 183-199.
    20. A. Pessoa & R. Sadykov & E. Uchoa & F. Vanderbeck, 2018. "Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 339-360, May.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    Statistics

    Access and download statistics

    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:inm:ormoor:v:49:y:2024:i:2:p:832-855. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.