IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v91y2025i3d10.1007_s10589-025-00683-y.html
   My bibliography  Save this article

Convergence rate of inexact augmented Lagrangian method with practical relative error criterion for composite convex programming

Author

Listed:
  • Yunfei Qu

    (Beihang University)

  • Xingju Cai

    (Nanjing Normal University)

  • Hongying Liu

    (Beihang University)

  • Deren Han

    (Beihang University)

Abstract

In this paper, we consider the composite convex optimization problem with a linear equality constraint. We propose a practical inexact augmented Lagrangian (IAL) framework that employs two relative error criteria. Under the first criterion, we demonstrate convergence and establish sublinear ergodic convergence rates. By incorporating the second criterion, we achieve sublinear non-ergodic convergence rates. Furthermore, we determine the total iteration complexity of the IAL framework by slightly relaxing these criteria. Numerical experiments on both synthetic and real-world problems are conducted to illustrate the efficiency of the proposed IAL method.

Suggested Citation

  • Yunfei Qu & Xingju Cai & Hongying Liu & Deren Han, 2025. "Convergence rate of inexact augmented Lagrangian method with practical relative error criterion for composite convex programming," Computational Optimization and Applications, Springer, vol. 91(3), pages 1227-1261, July.
    • Handle: RePEc:spr:coopap:v:91:y:2025:i:3:d:10.1007_s10589-025-00683-y
    DOI: 10.1007/s10589-025-00683-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-025-00683-y
    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/s10589-025-00683-y?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:coopap:v:91:y:2025:i:3:d:10.1007_s10589-025-00683-y. 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.