The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
A variational perspective on accelerated methods in optimization
Open accessAbstract
Significance: Optimization problems arise naturally in statistical machine learning and other fields concerned with data analysis. The rapid growth in the scale and complexity of modern datasets has led to a focus on gradient-based methods and also on the class of accelerated methods, first proposed by Nesterov in 1983. Accelerated methods achieve faster convergence rates than gradient methods and indeed, under certain conditions, they achieve optimal rates. However, accelerated methods are not descent methods and remain a conceptual mystery. We propose a variational, continuous-time framework for understanding accelerated methods. We provide a systematic methodology for converting accelerated higher-order methods from continuous time to discrete time. Our work illuminates a class of dynamics that may be useful for designing better algorithms for optimization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
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
Finite-time convergent gradient flows with applications to network consensus
Cortés, J. (2006) · Automatica · doi:10.1016/j.automatica.2006.06.015 · Cited by 818
Cubic regularization of Newton method and its global performance
Nesterov, Y., & Polyak, B. T. (2006) · Mathematical Programming · doi:10.1007/s10107-006-0706-8 · Cited by 781
Adaptive Restart for Accelerated Gradient Schemes
O’Donoghue, B., & Candès, E. (2015) · Foundations of Computational Mathematics · doi:10.1007/s10208-013-9150-3 · Cited by 642
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
Ghadimi, S., & Lan, G. (2016) · Mathematical Programming · doi:10.1007/s10107-015-0871-8 · Cited by 487
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 optimal method for stochastic composite optimization
Lan, G. (2012) · Mathematical Programming · doi:10.1007/s10107-010-0434-y · Cited by 427
Metadata
- Authors
- Wibisono, A., Wilson, A. C., & Jordan, M. I.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2016-11-09
- Volume
- 113
- Issue
- 47
- Pages
- E7351-E7358
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2298465274
- Cited by
- 440
- References
- 18
- FWCI
- 34.03
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A variational perspective on accelerated methods in optimization. https://app.cochat.ai/papers/10.1073/pnas.1614734113
- The paper
- Wibisono, A., Wilson, A. C., & Jordan, M. I. (2016). A variational perspective on accelerated methods in optimization. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1614734113
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.