IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v92y2025i2d10.1007_s10898-024-01454-5.html
   My bibliography  Save this article

Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints

Author

Listed:
  • Gao-Xi Li

    (Chongqing Technology and Business University
    Chongqing Technology and Business University)

  • Xin-Min Yang

    (Chongqing Normal University)

  • Xian-Jun Long

    (Chongqing Technology and Business University)

Abstract

In recent years, mathematical programs with complementarity constraints (MPCC) and a non-Lipschitz objective function have been introduced and are now more prevalent than locally Lipschitz MPCC. This paper proposes a smoothing partial augmented Lagrangian (SPAL) method to tackle this problem. However, due to the disruption of the complementary structure’s integrity by this method, proving its convergence becomes exceptionally challenging. We have achieved global convergence of the SPAL method. Specifically, we demonstrate that the accumulation point of the sequence generated by the SPAL method can be a strongly stationary point under the Mangasarian-Fromovitz qualification (MPCC-MFQ) and the boundedness of the multiplier corresponding to the orthogonal constraint. Moreover, if the aforementioned multiplier is unbounded, the accumulation point can be a Clarke stationary point under MPCC-MFQ and a suitable assumption. Numerical experiments indicate that the SPAL method surpasses existing methods in terms of the quality of accumulation points and running times.

Suggested Citation

  • Gao-Xi Li & Xin-Min Yang & Xian-Jun Long, 2025. "Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints," Journal of Global Optimization, Springer, vol. 92(2), pages 345-379, June.
    • Handle: RePEc:spr:jglopt:v:92:y:2025:i:2:d:10.1007_s10898-024-01454-5
    DOI: 10.1007/s10898-024-01454-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-024-01454-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/s10898-024-01454-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. J. V. Outrata, 1999. "Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints," Mathematics of Operations Research, INFORMS, vol. 24(3), pages 627-644, August.
    2. H. Luo & X. Sun & Y. Xu & H. Wu, 2010. "On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints," Journal of Global Optimization, Springer, vol. 46(2), pages 217-232, February.
    3. Lei Guo & Zhibin Deng, 2022. "A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 1229-1246, May.
    4. Holger Scheel & Stefan Scholtes, 2000. "Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 1-22, February.
    5. Yi Zhang & Jia Wu & Liwei Zhang, 2015. "First order necessary optimality conditions for mathematical programs with second-order cone complementarity constraints," Journal of Global Optimization, Springer, vol. 63(2), pages 253-279, October.
    6. H. Wu & H. Luo & J. Yang, 2014. "Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming," Journal of Global Optimization, Springer, vol. 59(4), pages 695-727, August.
    7. Xiaojiao Tong & Manlan Li & Hailin Sun, 2023. "Decision bounding problems for two-stage distributionally robust stochastic bilevel optimization," Journal of Global Optimization, Springer, vol. 87(2), pages 679-707, November.
    8. H. Z. Luo & X. L. Sun & Y. F. Xu, 2010. "Convergence Properties of Modified and Partially-Augmented Lagrangian Methods for Mathematical Programs with Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 145(3), pages 489-506, June.
    9. G.H. Lin & M. Fukushima, 2003. "New Relaxation Method for Mathematical Programs with Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 118(1), pages 81-116, July.
    10. Liwei Zhang & Yule Zhang & Jia Wu & Xiantao Xiao, 2022. "Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2989-3006, November.
    11. X. M. Hu & D. Ralph, 2004. "Convergence of a Penalty Method for Mathematical Programming with Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 123(2), pages 365-390, November.
    12. Mengwei Xu & Jane Ye & Liwei Zhang, 2015. "Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems," Journal of Global Optimization, Springer, vol. 62(4), pages 675-694, August.
    13. Y. Zhou & X. Yang, 2012. "Augmented Lagrangian functions for constrained optimization problems," Journal of Global Optimization, Springer, vol. 52(1), pages 95-108, January.
    14. Yu-Wei Li & Gui-Hua Lin & Xide Zhu, 2024. "Solving Bilevel Programs Based on Lower-Level Mond-Weir Duality," INFORMS Journal on Computing, INFORMS, vol. 36(5), pages 1225-1241, September.
    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. Lei Guo & Gaoxi Li, 2024. "Approximation Methods for a Class of Non-Lipschitz Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 202(3), pages 1421-1445, September.
    2. Yan-Chao Liang & Yue-Wen Liu & Gui-Hua Lin & Xide Zhu, 2023. "New Constraint Qualifications for Mathematical Programs with Second-Order Cone Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 199(3), pages 1249-1280, December.
    3. Christian Kanzow & Alexandra Schwartz, 2015. "The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited," Mathematics of Operations Research, INFORMS, vol. 40(2), pages 253-275, February.
    4. Gui-Hua Lin & Masao Fukushima, 2005. "A Modified Relaxation Scheme for Mathematical Programs with Complementarity Constraints," Annals of Operations Research, Springer, vol. 133(1), pages 63-84, January.
    5. Na Xu & Xide Zhu & Li-Ping Pang & Jian Lv, 2018. "Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(01), pages 1-20, February.
    6. Filippo Pecci & Edo Abraham & Ivan Stoianov, 2017. "Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks," Computational Optimization and Applications, Springer, vol. 67(1), pages 201-223, May.
    7. Nélida Echebest & María Daniela Sánchez & María Laura Schuverdt, 2016. "Convergence Results of an Augmented Lagrangian Method Using the Exponential Penalty Function," Journal of Optimization Theory and Applications, Springer, vol. 168(1), pages 92-108, January.
    8. Daniel Ralph & Oliver Stein, 2011. "The C-Index: A New Stability Concept for Quadratic Programs with Complementarity Constraints," Mathematics of Operations Research, INFORMS, vol. 36(3), pages 504-526, August.
    9. Giandomenico Mastroeni & Letizia Pellegrini & Alberto Peretti, 2021. "Some numerical aspects on a method for solving linear problems with complementarity constraints," Working Papers 16/2021, University of Verona, Department of Economics.
    10. Hu, X. & Ralph, R., 2006. "Using EPECs to model bilevel games in restructured electricity markets with locational prices," Cambridge Working Papers in Economics 0619, Faculty of Economics, University of Cambridge.
    11. H. Z. Luo & X. L. Sun & Y. F. Xu, 2010. "Convergence Properties of Modified and Partially-Augmented Lagrangian Methods for Mathematical Programs with Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 145(3), pages 489-506, June.
    12. H. Wu & H. Luo, 2012. "Saddle points of general augmented Lagrangians for constrained nonconvex optimization," Journal of Global Optimization, Springer, vol. 53(4), pages 683-697, August.
    13. H. Wu & H. Luo & J. Yang, 2014. "Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming," Journal of Global Optimization, Springer, vol. 59(4), pages 695-727, August.
    14. Hoai An Thi & Thi Minh Tam Nguyen & Tao Pham Dinh, 2023. "On solving difference of convex functions programs with linear complementarity constraints," Computational Optimization and Applications, Springer, vol. 86(1), pages 163-197, September.
    15. Lei Guo & Gui-Hua Lin, 2013. "Notes on Some Constraint Qualifications for Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 156(3), pages 600-616, March.
    16. Suhong Jiang & Jin Zhang & Caihua Chen & Guihua Lin, 2018. "Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints," Journal of Global Optimization, Springer, vol. 70(1), pages 223-236, January.
    17. Lei Guo & Gui-Hua Lin & Jane J. Ye, 2013. "Second-Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 158(1), pages 33-64, July.
    18. Joaquim Júdice, 2012. "Algorithms for linear programming with linear complementarity constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 4-25, April.
    19. H. Luo & H. Wu & G. Chen, 2012. "On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming," Journal of Global Optimization, Springer, vol. 54(3), pages 599-618, November.
    20. Nie, Pu-yan & Chen, Li-hua & Fukushima, Masao, 2006. "Dynamic programming approach to discrete time dynamic feedback Stackelberg games with independent and dependent followers," European Journal of Operational Research, Elsevier, vol. 169(1), pages 310-328, February.

    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:jglopt:v:92:y:2025:i:2:d:10.1007_s10898-024-01454-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.