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

An Adaptive Proximal Bundle Method with Inexact Oracles for a Class of Nonconvex and Nonsmooth Composite Optimization

Author

Listed:
  • Xiaoliang Wang

    (School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, China)

  • Liping Pang

    (School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, China)

  • Qi Wu

    (School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, China)

  • Mingkun Zhang

    (School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, China)

Abstract

In this paper, an adaptive proximal bundle method is proposed for a class of nonconvex and nonsmooth composite problems with inexact information. The composite problems are the sum of a finite convex function with inexact information and a nonconvex function. For the nonconvex function, we design the convexification technique and ensure the linearization errors of its augment function to be nonnegative. Then, the sum of the convex function and the augment function is regarded as an approximate function to the primal problem. For the approximate function, we adopt a disaggregate strategy and regard the sum of cutting plane models of the convex function and the augment function as a cutting plane model for the approximate function. Then, we give the adaptive nonconvex proximal bundle method. Meanwhile, for the convex function with inexact information, we utilize the noise management strategy and update the proximal parameter to reduce the influence of inexact information. The method can obtain an approximate solution. Two polynomial functions and six DC problems are referred to in the numerical experiment. The preliminary numerical results show that our algorithm is effective and reliable.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:8:p:874-:d:536849
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Gonglin Yuan & Zehong Meng & Yong Li, 2016. "A Modified Hestenes and Stiefel Conjugate Gradient Algorithm for Large-Scale Nonsmooth Minimizations and Nonlinear Equations," Journal of Optimization Theory and Applications, Springer, vol. 168(1), pages 129-152, January.
    2. Yang Yang & Liping Pang & Xuefei Ma & Jie Shen, 2014. "Constrained Nonconvex Nonsmooth Optimization via Proximal Bundle Method," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 900-925, December.
    3. Gonglin Yuan & Zengxin Wei & Qiumei Zhao, 2014. "A modified Polak–Ribière–Polyak conjugate gradient algorithm for large-scale optimization problems," IISE Transactions, Taylor & Francis Journals, vol. 46(4), pages 397-413.
    4. Laurent Condat, 2013. "A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite Terms," Journal of Optimization Theory and Applications, Springer, vol. 158(2), pages 460-479, August.
    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. A. Bagirov & J. Ugon, 2011. "Codifferential method for minimizing nonsmooth DC functions," Journal of Global Optimization, Springer, vol. 50(1), pages 3-22, May.
    7. 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.
    8. M. V. Solodov & S. K. Zavriev, 1998. "Error Stability Properties of Generalized Gradient-Type Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 98(3), pages 663-680, September.
    9. Krzysztof Czesław Kiwiel, 1985. "A Linearization Algorithm for Nonsmooth Minimization," Mathematics of Operations Research, INFORMS, vol. 10(2), pages 185-194, May.
    10. Tang, Chun-ming & Jian, Jin-bao, 2012. "Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions," European Journal of Operational Research, Elsevier, vol. 218(1), pages 28-37.
    11. Kaisa Joki & Adil M. Bagirov & Napsu Karmitsa & Marko M. Mäkelä, 2017. "A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes," Journal of Global Optimization, Springer, vol. 68(3), pages 501-535, July.
    12. 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.
    13. Grégory Emiel & Claudia Sagastizábal, 2010. "Incremental-like bundle methods with application to energy planning," Computational Optimization and Applications, Springer, vol. 46(2), pages 305-332, 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. 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.
    2. 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.
    3. Najmeh Hoseini Monjezi & S. Nobakhtian, 2019. "A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization," Computational Optimization and Applications, Springer, vol. 74(2), pages 443-480, November.
    4. 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.
    5. Najmeh Hoseini Monjezi & S. Nobakhtian, 2021. "A filter proximal bundle method for nonsmooth nonconvex constrained optimization," Journal of Global Optimization, Springer, vol. 79(1), pages 1-37, January.
    6. Liping Pang & Xiaoliang Wang & Fanyun Meng, 2023. "A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems," Journal of Global Optimization, Springer, vol. 86(3), pages 589-620, July.
    7. 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.
    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. 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.
    10. Welington Oliveira, 2019. "Proximal bundle methods for nonsmooth DC programming," Journal of Global Optimization, Springer, vol. 75(2), pages 523-563, October.
    11. M. V. Dolgopolik, 2020. "New global optimality conditions for nonsmooth DC optimization problems," Journal of Global Optimization, Springer, vol. 76(1), pages 25-55, January.
    12. Li-Ping Pang & Fan-Yun Meng & Jian-Song Yang, 2023. "A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems," Journal of Global Optimization, Springer, vol. 85(4), pages 891-915, April.
    13. Grégory Emiel & Claudia Sagastizábal, 2010. "Incremental-like bundle methods with application to energy planning," Computational Optimization and Applications, Springer, vol. 46(2), pages 305-332, June.
    14. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico & Adil M. Bagirov, 2018. "Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations," Journal of Global Optimization, Springer, vol. 71(1), pages 37-55, May.
    15. A. M. Bagirov & N. Hoseini Monjezi & S. Taheri, 2021. "An augmented subgradient method for minimizing nonsmooth DC functions," Computational Optimization and Applications, Springer, vol. 80(2), pages 411-438, November.
    16. Shuai Liu, 2019. "A simple version of bundle method with linear programming," Computational Optimization and Applications, Springer, vol. 72(2), pages 391-412, March.
    17. Martina Kuchlbauer & Frauke Liers & Michael Stingl, 2022. "Adaptive Bundle Methods for Nonlinear Robust Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2106-2124, July.
    18. Puya Latafat & Panagiotis Patrinos, 2017. "Asymmetric forward–backward–adjoint splitting for solving monotone inclusions involving three operators," Computational Optimization and Applications, Springer, vol. 68(1), pages 57-93, September.
    19. Xin Jiang & Lieven Vandenberghe, 2022. "Bregman primal–dual first-order method and application to sparse semidefinite programming," Computational Optimization and Applications, Springer, vol. 81(1), pages 127-159, January.
    20. Elena Tovbis & Vladimir Krutikov & Predrag Stanimirović & Vladimir Meshechkin & Aleksey Popov & Lev Kazakovtsev, 2023. "A Family of Multi-Step Subgradient Minimization Methods," Mathematics, MDPI, vol. 11(10), pages 1-24, May.

    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:9:y:2021:i:8:p:874-:d:536849. 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.