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.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.