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.

    References listed on IDEAS

    as
    1. Xin-Yuan Zhao & Liang Chen, 2020. "The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(04), pages 1-16, August.
    2. Ya-Feng Liu & Xin Liu & Shiqian Ma, 2019. "On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 632-650, May.
    3. NESTEROV, Yurii, 2013. "Gradient methods for minimizing composite functions," LIDAM Reprints CORE 2510, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Jiaxin Xie, 2018. "On inexact ADMMs with relative error criteria," Computational Optimization and Applications, Springer, vol. 71(3), pages 743-765, December.
    5. Bingsheng He & Min Tao & Xiaoming Yuan, 2017. "Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 662-691, August.
    6. R. T. Rockafellar, 1976. "Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 97-116, May.
    7. Gareth M. James & Courtney Paulson & Paat Rusmevichientong, 2020. "Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 115(529), pages 107-122, January.
    8. Weiwei Kong & Jefferson G. Melo & Renato D. C. Monteiro, 2023. "Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints," Mathematics of Operations Research, INFORMS, vol. 48(2), pages 1066-1094, May.
    9. Qihang Lin & Runchao Ma & Yangyang Xu, 2022. "Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization," Computational Optimization and Applications, Springer, vol. 82(1), pages 175-224, May.
    10. Jonathan Eckstein & Wang Yao, 2017. "Approximate ADMM algorithms derived from Lagrangian splitting," Computational Optimization and Applications, Springer, vol. 68(2), pages 363-405, November.
    11. Aleksandr Aravkin & Damek Davis, 2020. "Trimmed Statistical Estimation via Variance Reduction," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 292-322, February.
    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. Jefferson G. Melo & Renato D. C. Monteiro & Hairong Wang, 2024. "A Proximal Augmented Lagrangian Method for Linearly Constrained Nonconvex Composite Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 202(1), pages 388-420, July.
    2. Ya-Feng Liu & Xin Liu & Shiqian Ma, 2019. "On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 632-650, May.
    3. Hedy Attouch & Zaki Chbani & Jalal Fadili & Hassan Riahi, 2022. "Fast Convergence of Dynamical ADMM via Time Scaling of Damped Inertial Dynamics," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 704-736, June.
    4. Bingsheng He & Xiaoming Yuan, 2018. "A class of ADMM-based algorithms for three-block separable convex programming," Computational Optimization and Applications, Springer, vol. 70(3), pages 791-826, July.
    5. Yunier Bello-Cruz & Max L. N. Gonçalves & Nathan Krislock, 2023. "On FISTA with a relative error rule," Computational Optimization and Applications, Springer, vol. 84(2), pages 295-318, March.
    6. Mauricio Romero Sicre, 2020. "On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems," Computational Optimization and Applications, Springer, vol. 76(3), pages 991-1019, July.
    7. Kaiwen Ma & Nikolaos V. Sahinidis & Sreekanth Rajagopalan & Satyajith Amaran & Scott J Bury, 2021. "Decomposition in derivative-free optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 269-292, October.
    8. Hao Wang & Hao Zeng & Jiashan Wang, 2022. "An extrapolated iteratively reweighted $$\ell _1$$ ℓ 1 method with complexity analysis," Computational Optimization and Applications, Springer, vol. 83(3), pages 967-997, December.
    9. A. Scagliotti & P. Colli Franzone, 2022. "A piecewise conservative method for unconstrained convex optimization," Computational Optimization and Applications, Springer, vol. 81(1), pages 251-288, January.
    10. Ren Jiang & Zhifeng Ji & Wuling Mo & Suhua Wang & Mingjun Zhang & Wei Yin & Zhen Wang & Yaping Lin & Xueke Wang & Umar Ashraf, 2022. "A Novel Method of Deep Learning for Shear Velocity Prediction in a Tight Sandstone Reservoir," Energies, MDPI, vol. 15(19), pages 1-20, September.
    11. Maryam Yashtini, 2022. "Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization," Journal of Global Optimization, Springer, vol. 84(4), pages 913-939, December.
    12. Jean-Pierre Crouzeix & Abdelhak Hassouni & Eladio Ocaña, 2023. "A Short Note on the Twice Differentiability of the Marginal Function of a Convex Function," Journal of Optimization Theory and Applications, Springer, vol. 198(2), pages 857-867, August.
    13. Liang Chen & Anping Liao, 2020. "On the Convergence Properties of a Second-Order Augmented Lagrangian Method for Nonlinear Programming Problems with Inequality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 187(1), pages 248-265, October.
    14. Weiwei Kong & Jefferson G. Melo & Renato D. C. Monteiro, 2020. "An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems," Computational Optimization and Applications, Springer, vol. 76(2), pages 305-346, June.
    15. Stefano Cipolla & Jacek Gondzio, 2023. "Proximal Stabilized Interior Point Methods and Low-Frequency-Update Preconditioning Techniques," Journal of Optimization Theory and Applications, Springer, vol. 197(3), pages 1061-1103, June.
    16. Bingsheng He & Li-Zhi Liao & Xiang Wang, 2012. "Proximal-like contraction methods for monotone variational inequalities in a unified framework I: Effective quadruplet and primary methods," Computational Optimization and Applications, Springer, vol. 51(2), pages 649-679, March.
    17. Marwan A. Kutbi & Abdul Latif & Xiaolong Qin, 2019. "Convergence of Two Splitting Projection Algorithms in Hilbert Spaces," Mathematics, MDPI, vol. 7(10), pages 1-13, October.
    18. Brecht Evens & Puya Latafat & Panagiotis Patrinos, 2025. "Convergence of the Chambolle–Pock Algorithm in the Absence of Monotonicity," Journal of Optimization Theory and Applications, Springer, vol. 206(1), pages 1-45, July.
    19. Darinka Dentcheva & Gabriela Martinez & Eli Wolfhagen, 2016. "Augmented Lagrangian Methods for Solving Optimization Problems with Stochastic-Order Constraints," Operations Research, INFORMS, vol. 64(6), pages 1451-1465, December.
    20. Gui-Hua Lin & Zhen-Ping Yang & Hai-An Yin & Jin Zhang, 2023. "A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems," Computational Optimization and Applications, Springer, vol. 86(2), pages 669-710, November.

    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.

    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.