IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v206y2025i2d10.1007_s10957-025-02731-3.html
   My bibliography  Save this article

Global Convergence of a Second-order Augmented Lagrangian Method Under an Error Bound Condition

Author

Listed:
  • Roberto Andreani

    (University of Campinas)

  • Gabriel Haeser

    (University of São Paulo)

  • Renan William Prado

    (University of São Paulo)

  • Maria L. Schuverdt

    (National University of La Plata)

  • Leonardo D. Secchin

    (Federal University of Espírito Santo)

Abstract

This work deals with convergence to points satisfying the weak second-order necessary optimality conditions of a second-order safeguarded augmented Lagrangian method from the literature. To this end, we propose a new second-order sequential optimality condition that is, in a certain way, based on the iterates generated by the algorithm itself. This also allows us to establish the best possible global convergence result for the method studied, from which a companion constraint qualification is derived. The companion constraint qualification is independent of the Mangasarian-Fromovitz and constant-rank constraint qualifications and remains verifiable without them, as it can be certified by other known constraint qualifications. Furthermore, unlike similar results from previous works, the new constraint qualification cannot be weakened by another one with second-order global convergence guarantees for the method and assures second-order stationarity without the need for constant rank hypotheses. To guarantee the latter result, we established the convergence of the method under a property slightly stronger than the error bound constraint qualification, which, until now, has not been known to be associated with nonlinear optimization methods.

Suggested Citation

  • Roberto Andreani & Gabriel Haeser & Renan William Prado & Maria L. Schuverdt & Leonardo D. Secchin, 2025. "Global Convergence of a Second-order Augmented Lagrangian Method Under an Error Bound Condition," Journal of Optimization Theory and Applications, Springer, vol. 206(2), pages 1-30, August.
  • Handle: RePEc:spr:joptap:v:206:y:2025:i:2:d:10.1007_s10957-025-02731-3
    DOI: 10.1007/s10957-025-02731-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-025-02731-3
    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/s10957-025-02731-3?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:joptap:v:206:y:2025:i:2:d:10.1007_s10957-025-02731-3. 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.