Preprint · 2017 · Open access
Global convergence rates of augmented Lagrangian methods for constrained convex programming.
arXiv (Cornell University) · Published 15 November 2017
In brief
“Global convergence rates of augmented Lagrangian methods for constrained convex programming.” is a 2017 preprint by Yangyang Xu, published in arXiv (Cornell University). OpenAlex counts 11 citations as of 18 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 11
- Most cited in
- 2019 (3)
- References
- 23
- Authors
- 1
Abstract
Augmented Lagrangian method (ALM) has been popularly used for solving constrained optimization problems. Its convergence and local convergence speed have been extensively studied. However, its global convergence rate is still open for problems with nonlinear inequality constraints. In this paper, we work on general constrained convex programs. For these problems, we establish the global convergence rate of ALM and its inexact variants. We first assume exact solution to each subproblem in the ALM framework and establish an $O(1/k)$ ergodic convergence result, where $k$ is the number of iterations. Then we analyze an inexact ALM that approximately solves the subproblems. Assuming summable errors, we prove that the inexact ALM also enjoys $O(1/k)$ convergence if smaller stepsizes are used in the multiplier updates. Furthermore, we apply the inexact ALM to a constrained composite convex problem with each subproblem solved by Nesterov's optimal first-order method. We show that $O(\varepsilon^{-\frac{3}{2}-\delta})$ gradient evaluations are sufficient to guarantee an $\varepsilon$-optimal solution in terms of both primal objective and feasibility violation, where $\delta$ is an arbitrary positive number. Finally, for constrained smooth problems, we modify the inexact ALM by adding a proximal term to each subproblem and improve the iteration complexity to $O(\varepsilon^{-1}|\log\varepsilon|)$.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Xu, Y. (2017). Global convergence rates of augmented Lagrangian methods for constrained convex programming. arXiv (Cornell University). https://arxiv.org/pdf/1711.05812.pdf
MLA 9
Xu, Yangyang. “Global convergence rates of augmented Lagrangian methods for constrained convex programming.” arXiv (Cornell University), 2017. https://arxiv.org/pdf/1711.05812.pdf.
Chicago
Xu, Yangyang. 2017. “Global convergence rates of augmented Lagrangian methods for constrained convex programming.” arXiv (Cornell University). https://arxiv.org/pdf/1711.05812.pdf.
Harvard
Xu, Y. (2017) ‘Global convergence rates of augmented Lagrangian methods for constrained convex programming.’, arXiv (Cornell University). Available at: https://arxiv.org/pdf/1711.05812.pdf.
IEEE
Y. Xu, “Global convergence rates of augmented Lagrangian methods for constrained convex programming.,” arXiv (Cornell University), 2017.
BibTeX
@misc{xu2017global,
title = {{Global convergence rates of augmented Lagrangian methods for constrained convex programming.}},
author = {Xu, Yangyang},
howpublished = {arXiv (Cornell University)},
year = {2017},
url = {https://arxiv.org/pdf/1711.05812.pdf}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 1 | |
| 2019 | 3 | |
| 2020 | 3 | |
| 2021 | 2 | |
| 2023 | 2 |
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- augmented Lagrangian method
- global convergence rate
- inexact subproblem solutions
- ergodic convergence
- composite convex optimization
- proximal term
- iteration complexity
- nonlinear inequality constraints
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Xu, Y. (2017). Global convergence rates of augmented Lagrangian methods for constrained convex programming. arXiv (Cornell University). https://arxiv.org/pdf/1711.05812.pdf
How many times has this paper been cited?
11 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the full text from this page.
Who wrote this paper?
Yangyang Xu.
Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.