The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
Open accessAbstract
In this paper, we generalize the well-known Nesterov’s accelerated gradient (AG) method, originally designed for convex smooth optimization, to solve nonconvex and possibly stochastic optimization problems. We demonstrate that by properly specifying the stepsize policy, the AG method exhibits the best known rate of convergence for solving general nonconvex smooth optimization problems by using first-order information, similarly to the gradient descent method. We then consider an important class of composite optimization problems and show that the AG method can solve them uniformly, i.e., by using the same aggressive stepsize policy as in the convex case, even if the problem turns out to be nonconvex. We demonstrate that the AG method exhibits an optimal rate of convergence if the composite problem is convex, and improves the best known rate of convergence if the problem is nonconvex. Based on the AG method, we also present new nonconvex stochastic approximation methods and show that they can improve a few existing rates of convergence for nonconvex stochastic optimization. To the best of our knowledge, this is the first time that the convergence of the AG method has been established for solving nonconvex nonlinear programming in the literature.
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
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Fan, J., & Li, R. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753382273 · Cited by 8,900
Simulation Modeling and Analysis.
Schervish, M. J., Law, A. M., & Kelton, W. D. (1983) · Journal of the American Statistical Association · doi:10.2307/2288169 · Cited by 8,697
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Convex Analysis and Minimization Algorithms I
Hiriart-Urruty, J.-B., & Lemaréchal, C. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-02796-7 · Cited by 2,378
Online dictionary learning for sparse coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553463 · Cited by 2,114
Robust Stochastic Approximation Approach to Stochastic Programming
Nemirovski, A., Juditsky, A., Lan, G., & Shapiro, A. (2009) · SIAM Journal on Optimization · doi:10.1137/070704277 · Cited by 1,945
Self-citationIntroduction to Stochastic Search and Optimization: Estimation, Simulation, and Control
Spall, J. C. (2003) · Wiley eBooks · doi:10.1002/0471722138 · Cited by 1,890
Acceleration of Stochastic Approximation by Averaging
Polyak, B. T., & Juditsky, A. B. (1992) · SIAM Journal on Control and Optimization · doi:10.1137/0330046 · Cited by 1,827 · cited 1×
“, [10,11,15,23,30,31,33]) require the convexity assumption about Ψ .”
BackgroundProblem complexity and method efficiency in optimization
(1984) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(84)90101-0 · Cited by 1,329
Gradient methods for minimizing composite functions
Nesterov, Y. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0629-5 · Cited by 1,298
Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
Ghadimi, S., & Lan, G. (2013) · SIAM Journal on Optimization · doi:10.1137/120880811 · Cited by 1,034
Self-citationINTRODUCTION TO STOCHASTIC SEARCH AND OPTIMIZATION: ESTIMATION, SIMULATION, AND CONTROL
Nowak, W. (2012) · Medical Entomology and Zoology · Cited by 1,033
A method for unconstrained convex minimization problem with the rate of convergence o(1/k^2)
Nesterov, Y. E. (1983) · Medical Entomology and Zoology · Cited by 865
Feature Article: Optimization for simulation: Theory vs. Practice
Fu, M. C. (2002) · INFORMS Journal on Computing · doi:10.1287/ijoc.14.3.192.113 · Cited by 742
An optimal method for stochastic composite optimization
Lan, G. (2012) · Mathematical Programming · doi:10.1007/s10107-010-0434-y · Cited by 427 · cited 8×
“(1.5) Currently, the randomized stochastic gradient (RSG) method initially studied by Ghadimi and Lan [12] and later improved in [13,6] seems to be the only available stochastic approximation (SA) algorithm for solving the aforementioned general stochastic NLP problems, while other SA methods (see, e.g., [29,22,31,28,…”
BackgroundMethodInfluentialSelf-citationGhadimi, S., & Lan, G. (2012) · SIAM Journal on Optimization · doi:10.1137/110848864 · Cited by 269
Self-citationA review of simulation optimization techniques
Andradottir, S. (2002) · 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274) · doi:10.1109/wsc.1998.744910 · Cited by 204
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
Gratton, S., Sartenaer, A., & Toint, P. L. (2008) · SIAM Journal on Optimization · doi:10.1137/050623012 · Cited by 174
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
Ghadimi, S., & Lan, G. (2013) · SIAM Journal on Optimization · doi:10.1137/110848876 · Cited by 167
Self-citationComplexity of unconstrained $$L_2-L_p$$ minimization
Chen, X., Ge, D., Wang, Z., & Ye, Y. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0613-0 · Cited by 158
The Complexity of Large-scale Convex Programming under a Linear Optimization OraclePreprint
Lan, G. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.5550 · Cited by 153
Self-citationMonteiro, R. D. C., & Svaiter, B. F. (2013) · SIAM Journal on Optimization · doi:10.1137/110833786 · Cited by 149
Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization
Dang, C. D., & Lan, G. (2015) · SIAM Journal on Optimization · doi:10.1137/130936361 · Cited by 121
Self-citationIteration-complexity of first-order augmented Lagrangian methods for convex programming
Lan, G., & Monteiro, R. D. C. (2015) · Mathematical Programming · doi:10.1007/s10107-015-0861-x · Cited by 115
Self-citationIteration-complexity of first-order penalty methods for convex programming
Lan, G., & Monteiro, R. D. C. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0588-x · Cited by 68
Self-citation
Cited by
A variational perspective on accelerated methods in optimization
Wibisono, A., Wilson, A. C., & Jordan, M. I. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1614734113 · Cited by 440
A Globally Convergent Algorithm for Nonconvex Optimization Based on Block Coordinate Update
Xu, Y., & Yin, W. (2017) · Journal of Scientific Computing · doi:10.1007/s10915-017-0376-0 · Cited by 285
On the Convergence of a Family of Robust Losses for Stochastic Gradient Descent
Han, B., Tsang, I. W., & Chen, L. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46128-1_42 · Cited by 25
Metadata
- Authors
- Ghadimi, S., & Lan, G.
- Venue
- Mathematical Programming
- Published
- 2015-02-21
- Volume
- 156
- Issue
- 1-2
- Pages
- 59-99
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W1987083649
- Cited by
- 487
- References
- 30
- FWCI
- 38.16
- 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.