Fetching the paper…
Reading the bibliography…
We present an accelerated gradient method for non-convex optimization problems with Lipschitz continuous first and second derivatives.
Problem Complexity and Method Efficiency in Optimization
A. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate O ( 1 / k 2 ) {O}(1/k^{2})
Y. Nesterov · 1983
Earlier work this paper cites.
Some NP-complete problems in quadratic and nonlinear programming
K. Murty and S. Kabadi · 1987
Earlier work this paper cites.
Estimating the largest eigenvalue by the power and lanczos algorithms with a random start
J. Kuczynski and H. Wozniakowski · 1992
Earlier work this paper cites.
Fast exact multiplication by the Hessian
B. A. Pearlmutter · 1994
Earlier work this paper cites.
Variational Analysis
R. T. Rockafellar and R. J. B. Wets · 1998
Earlier work this paper cites.
On the complexity of approximating a KKT point of quadratic programming
Y. Ye · 1998
Earlier work this paper cites.
Squared functional systems and optimization problems
Y. Nesterov · 2000
Earlier work this paper cites.
Fast curvature matrix-vector products for second-order gradient descent
N. N. Schraudolph · 2002
Earlier work this paper cites.
Convex Optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Introductory Lectures on Convex Optimization
Y. Nesterov · 2004
Earlier work this paper cites.
Cubic regularization of Newton method and its global performance
Y. Nesterov and B. T. Polyak · 2006
Earlier work this paper cites.
Random fields and geometry
R. J. Adler and J. E. Taylor · 2009
Earlier work this paper cites.
Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results
C. Cartis, N. I. Gould, and P. L. Toint · 2011
Earlier work this paper cites.
A note on the complexity of l p l_{p} minimization
D. Ge, X. Jiang, and Y. Ye · 2011
Earlier work this paper cites.
How to make the gradients small
Y. Nesterov · 2012
Cited alongside, same era.
Approximating the exponential, the lanczos method and an o (m)-time spectral algorithm for balanced separator
L. Orecchia, S. Sachdeva, and N. K. Vishnoi · 2012
Cited alongside, same era.
Multiplying matrices faster than Coppersmith-Winograd
V. V. Williams · 2012
Cited alongside, same era.
Stochastic first- and zeroth-order methods for nonconvex stochastic programming
S. Ghadimi and G. Lan · 2013
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T. Zhang · 2013
Cited alongside, same era.
Linear coupling: An ultimate unification of gradient and mirror descent
Z. Allen-Zhu and L. Orecchia · 2014
Accelerated proximal gradient methods for nonconvex programming
H. Li and Z. Lin · 2015
Later among the works it cites.
A universal catalyst for first-order optimization
H. Lin, J. Mairal, and Z. Harchaoui · 2015
Later among the works it cites.
When are nonconvex problems not scary?
J. Sun, Q. Qu, and J. Wright · 2015
Later among the works it cites.
Finding local minima for nonconvex optimization in linear time
N. Agarwal, Z. Allen-Zhu, B. Bullins, E. Hazan, and T. Ma · 2016
Closest in time.
Variance reduction for faster non-convex optimization
Z. Allen-Zhu and E. Hazan · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives
A. Defazio, F. Bach, and S. Lacoste-Julien · 2014
Cited alongside, same era.
Proximal algorithms
N. Parikh, S. P. Boyd, et al · 2014
Cited alongside, same era.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
S. Shalev-Shwartz and T. Zhang · 2014
Cited alongside, same era.
On the use of iterative methods in cubic regularization for unconstrained optimization
T. Bianconcini, G. Liuzzi, B. Morini, and M. Sciandrone · 2015
Cited alongside, same era.
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
E. Birgin, J. Gardenghi, J. Martınez, S. Santos, and P. L. Toint · 2015
Cited alongside, same era.
A geometric alternative to Nesterov’s accelerated gradient descent
S. Bubeck, Y. T. Lee, and M. Singh · 2015
Cited alongside, same era.
Z. Allen Zhu and Y. Li · 2016
Closest in time.
Efficient approaches for escaping higher order saddle points in non-convex optimization
A. Anandkumar and R. Ge · 2016
Closest in time.
Accelerated methods for non-convex optimization
Y. Carmon, J. C. Duchi, O. Hinder, and A. Sidford · 2016
Closest in time.
Faster eigenvector computation via shift-and-invert preconditioning
D. Garber, E. Hazan, C. Jin, S. M. Kakade, C. Musco, P. Netrapalli, and A. Sidford · 2016
Closest in time.
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
S. Ghadimi and G. Lan · 2016
Closest in time.
A linear-time algorithm for trust region problems
E. Hazan and T. Koren · 2016
Closest in time.
A second-order cone based approach for solving the trust-region subproblem and its variants
N. Ho-Nguyen and F. Kılınc-Karzan · 2016
Closest in time.
Gradient descent only converges to minimizers
J. D. Lee, M. Simchowitz, M. I. Jordan, and B. Recht · 2016
Closest in time.
Stochastic variance reduction for nonconvex optimization
S. J. Reddi, A. Hefny, S. Sra, B. Póczós, and A. Smola · 2016
Closest in time.