Journal article · 2019 · Open access
On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming
Mathematics of Operations Research, 44(2), 632–650 · Published 19 April 2019 · DOI 10.1287/moor.2018.0939
In brief
“On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming” is a 2019 journal article by Ya‐Feng Liu and 2 co-authors, published in Mathematics of Operations Research. OpenAlex counts 76 citations as of 18 November 2026, which puts it in the top 5% of works published in 2019 by citations. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 76
- Most cited in
- 2026 (16)
- Field-weighted impact
- 4.28
- References
- 41
- Authors
- 3
Abstract
In this paper, we consider the linearly constrained composite convex optimization problem, whose objective is a sum of a smooth function and a possibly nonsmooth function. We propose an inexact augmented Lagrangian (IAL) framework for solving the problem. The stopping criterion used in solving the augmented Lagrangian subproblem in the proposed IAL framework is weaker and potentially much easier to check than the one used in most of the existing IAL frameworks/methods. We analyze the global convergence and the nonergodic convergence rate of the proposed IAL framework. Preliminary numerical results are presented to show the efficiency of the proposed IAL framework and the importance of the nonergodic convergence and convergence rate analysis.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Liu, Y., Liu, X., & Ma, S. (2019). On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming. Mathematics of Operations Research, 44(2), 632–650. https://doi.org/10.1287/moor.2018.0939
MLA 9
Liu, Ya‐Feng, et al. “On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming.” Mathematics of Operations Research, vol. 44, no. 2, 2019, pp. 632–650. https://doi.org/10.1287/moor.2018.0939.
Chicago
Liu, Ya‐Feng, Xin Liu, and Shiqian Ma. 2019. “On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming.” Mathematics of Operations Research 44 (2): 632–650. https://doi.org/10.1287/moor.2018.0939.
Harvard
Liu, Y., Liu, X. and Ma, S. (2019) ‘On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming’, Mathematics of Operations Research, 44(2), pp. 632–650. doi:10.1287/moor.2018.0939.
IEEE
Y. Liu, X. Liu, and S. Ma, “On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming,” Mathematics of Operations Research, vol. 44, no. 2, pp. 632–650, 2019, doi: 10.1287/moor.2018.0939.
BibTeX
@article{liu2019nonergodic,
title = {{On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming}},
author = {Liu, Ya‐Feng and Liu, Xin and Ma, Shiqian},
journal = {Mathematics of Operations Research},
year = {2019},
volume = {44},
number = {2},
pages = {632--650},
doi = {10.1287/moor.2018.0939},
url = {https://doi.org/10.1287/moor.2018.0939}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2018 | 3 | |
| 2019 | 4 | |
| 2020 | 7 | |
| 2021 | 7 | |
| 2022 | 6 | |
| 2023 | 11 | |
| 2024 | 8 | |
| 2025 | 14 | |
| 2026 | 16 |
Its field-weighted citation impact is 4.28: it has been cited 4.28 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- composite convex optimization
- global convergence
- linearly constrained optimization
- nonsmooth optimization
- stopping rules
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?
Liu, Y., Liu, X., & Ma, S. (2019). On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming. Mathematics of Operations Research, 44(2), 632–650. https://doi.org/10.1287/moor.2018.0939
How many times has this paper been cited?
76 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 PDF from this page.
Who wrote this paper?
Ya‐Feng Liu, Xin Liu, Shiqian Ma.
What is the DOI of this paper?
10.1287/moor.2018.0939, permanently at https://doi.org/10.1287/moor.2018.0939. Sign in and open it from this page.
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.