The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
Open accessAbstract
The forward-backward algorithm is a powerful tool for solving optimization problems with an additively separable and smooth plus nonsmooth structure. In the convex setting, a simple but ingenious acceleration scheme developed by Nesterov improves the theoretical rate of convergence for the function values from the standard $\mathcal O(k^{-1})$ down to $\mathcal O(k^{-2})$. In this short paper, we prove that the rate of convergence of a slight variant of Nesterov's accelerated forward-backward method, which produces convergent sequences, is actually $o(k^{-2})$, rather than $\mathcal O(k^{-2})$. Our arguments rely on the connection between this algorithm and a second-order differential inclusion with vanishing damping.
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
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
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H., & Combettes, P. L. (2017) · CMS Books in Mathematics · doi:10.1007/978-3-319-48311-5 · Cited by 3,307
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H., & Combettes, P. L. (2011) · CMS Books in Mathematics · doi:10.1007/978-1-4419-9467-7 · Cited by 2,962
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
A method for solving the convex programming problem with convergence rate O(1/k^2)
Nesterov, Y. E. (1983) · Доклады Академии наук · Cited by 2,662
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Weak convergence of the sequence of successive approximations for nonexpansive mappings
Opial, Z. (1967) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1967-11761-0 · Cited by 2,340
Splitting Algorithms for the Sum of Two Nonlinear Operators
Lions, P. L., & Mercier, B. (1979) · SIAM Journal on Numerical Analysis · doi:10.1137/0716071 · Cited by 1,972
Gradient methods for minimizing composite objective function
Nesterov, Y. E. (2007) · Cited by 867
Constrained minimization methods
Levitin, E. S., & Polyak, B. T. (1966) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(66)90114-5 · Cited by 846
Convex programming in Hilbert space
Goldstein, A. A. (1964) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1964-11178-2 · Cited by 633
Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
Passty, G. B. (1979) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(79)90234-8 · Cited by 609
A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
Su, W., Boyd, S., & Candès, E. J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.01243 · Cited by 481
An Inertial Forward-Backward Algorithm for Monotone Inclusions
Lorenz, D. A., & Pock, T. (2015) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-014-0523-2 · Cited by 445
Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization
Schmidt, M., Roux, N. L., & Bach, F. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.2415 · Cited by 237
Accelerated and Inexact Forward-Backward Algorithms
Villa, S., Salzo, S., Baldassarre, L., & Verri, A. (2013) · SIAM Journal on Optimization · doi:10.1137/110844805 · Cited by 197
Optimized first-order methods for smooth convex minimization
Kim, D., & Fessler, J. A. (2016) · Mathematical Programming · doi:10.1007/s10107-015-0949-3 · Cited by 159
Chambolle, A., & Pock, T. (2016) · SMAI Journal of Computational Mathematics · doi:10.5802/smai-jcm.3 · Cited by 62
Metadata
- Authors
- Attouch, H., & Peypouquet, J.
- Venue
- SIAM Journal on Optimization
- Published
- 2016-01
- Volume
- 26
- Issue
- 3
- Pages
- 1824-1834
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W1837565340
- Cited by
- 273
- References
- 20
- FWCI
- 20.84
- 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.