Convergence rate of inexact augmented Lagrangian method with practical relative error criterion for composite convex programming
Yunfei Qu,
Xingju Cai,
Hongying Liu and
Deren Han ()
Additional contact information
Yunfei Qu: Beihang University
Xingju Cai: Nanjing Normal University
Hongying Liu: Beihang University
Deren Han: Beihang University
Computational Optimization and Applications, 2025, vol. 91, issue 3, No 7, 1227-1261
Abstract:
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.
Keywords: Inexact augmented Lagrangian method; Convergence rate; Composite convex programming; Relative error criterion; 90C25; 90C90; 65K05 (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10589-025-00683-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:91:y:2025:i:3:d:10.1007_s10589-025-00683-y
Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589
DOI: 10.1007/s10589-025-00683-y
Access Statistics for this article
Computational Optimization and Applications is currently edited by William W. Hager
More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().