The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
Open accessAbstract
The proximal gradient algorithm for minimizing the sum of a smooth and nonsmooth convex function often converges linearly even without strong convexity. One common reason is that a multiple of the step length at each iteration may linearly bound the “error”—the distance to the solution set. We explain the observed linear convergence intuitively by proving the equivalence of such an error bound to a natural quadratic growth condition. Our approach generalizes to linear and quadratic convergence analysis for proximal methods (of Gauss-Newton type) for minimizing compositions of nonsmooth functions with smooth mappings. We observe incidentally that short step-lengths in the algorithm indicate near-stationarity, suggesting a reliable termination criterion.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Rockafellar, R. T., & Wets, R. J. B. (1998) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-642-02431-3 · Cited by 4,086
Monotone Operators and the Proximal Point Algorithm
Rockafellar, R. T. (1976) · SIAM Journal on Control and Optimization · doi:10.1137/0314056 · Cited by 3,559
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Algorithms in Real Algebraic Geometry
Basu, S., Pollack, R., & Roy, M.-F. (2006) · Algorithms and computation in mathematics · doi:10.1007/3-540-33099-2 · Cited by 868
Error bounds and convergence analysis of feasible descent methods: a general approach
Luo, Z.-Q., & Tseng, P. (1993) · Annals of Operations Research · doi:10.1007/bf02096261 · Cited by 420
Prox-regular functions in variational analysis
Poliquin, R. A., & Rockafellar, R. T. (1996) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-96-01544-9 · Cited by 333
Linear convergence of first order methods for non-strongly convex optimization
Necoara, I., Nesterov, Y., & Glineur, F. (2019) · Mathematical Programming · doi:10.1007/s10107-018-1232-1 · Cited by 258
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Tseng, P. (2010) · Mathematical Programming · doi:10.1007/s10107-010-0394-2 · Cited by 224
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Basu, S., Pollack, R. M., & Roy, M.-F. (2006) · Springer eBooks · Cited by 179
Efficiency of minimizing compositions of convex functions and smooth maps
Drusvyatskiy, D., & Paquette, C. (2018) · Mathematical Programming · doi:10.1007/s10107-018-1311-3 · Cited by 179
Self-citationA unified approach to error bounds for structured convex optimization problems
Zhou, Z., & So, A. M.-C. (2017) · Mathematical Programming · doi:10.1007/s10107-016-1100-9 · Cited by 173
A proximal method for composite minimization
Lewis, A. S., & Wright, S. J. (2016) · Mathematical Programming · doi:10.1007/s10107-015-0943-9 · Cited by 167
Self-citationBayesian Support Vector Regression Using a Unified Loss Function
Chu, W., Keerthi, S. S., & Ong, C. J. (2004) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2003.820830 · Cited by 144
A Gauss—Newton method for convex composite optimization
Burke, J. V., & Ferris, M. C. (1995) · Mathematical Programming · doi:10.1007/bf01585997 · Cited by 134
Descent methods for composite nondifferentiable optimization problems
Burke, J. V. (1985) · Mathematical Programming · doi:10.1007/bf01584377 · Cited by 119
On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
Luo, Z.-Q. T., & Tseng, P. (1993) · Mathematics of Operations Research · doi:10.1287/moor.18.4.846 · Cited by 74
Quadratic growth and critical point stability of semi-algebraic functions
Drusvyatskiy, D., & Ioffe, A. D. (2014) · Mathematical Programming · doi:10.1007/s10107-014-0820-y · Cited by 36
Self-citationTilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification
Mordukhovich, B. S., & Outrata, J. V. (2013) · ASEP · Cited by 23
Orthogonal Matching Pursuit for Sparse Quantile Regression
Aravkin, A. Y., Lozano, A. C., Luss, R., & Kambadur, P. (2014) · Proceedings · doi:10.1109/icdm.2014.134 · Cited by 19
Cited by
Stochastic Model-Based Minimization of Weakly Convex Functions
Davis, D., & Drusvyatskiy, D. (2019) · SIAM Journal on Optimization · doi:10.1137/18m1178244 · Cited by 258
Self-citation
Metadata
- Authors
- Drusvyatskiy, D., & Lewis, A. S.
- Venue
- Mathematics of Operations Research
- Published
- 2018-08
- Volume
- 43
- Issue
- 3
- Pages
- 919-948
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2278798990
- Cited by
- 267
- References
- 22
- FWCI
- 23.26
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.