Fetching the paper…
Reading the bibliography…
We consider the minimization of non-convex quadratic forms regularized by a cubic term, which exhibit multiple saddle points and poor local minima.
Some methods of speeding up the convergence of iteration methods
B. T. Polyak · 1964
Earlier work this paper cites.
The modification of Newton’s method for unconstrained optimization by bounding cubic terms
A. Griewank · 1981
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.
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.
Numerical Linear Algebra
L. N. Trefethen and D. Bau III · 1997
Earlier work this paper cites.
A D.C. optimization algorithm for solving the trust-region subproblem
P. D. Tao and L. T. H. An · 1998
Earlier work this paper cites.
Solving the trust-region subproblem using the Lanczos method
N. I. M. Gould, S. Lucidi, M. Roma, and P. L. Toint · 1999
Earlier work this paper cites.
Trust Region Methods
A. R. Conn, N. I. M. Gould, and P. L. Toint · 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.
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. Polyak · 2006
Cited alongside, same era.
Numerical Optimization
J. Nocedal and S. J. Wright · 2006
Cited alongside, same era.
Gradient methods for minimizing composite objective function
Y. Nesterov · 2007
Cited alongside, same era.
Affine conjugate adaptive Newton methods for nonlinear elastomechanics
M. Weiser, P. Deuflhard, and B. Erdmann · 2007
Cited alongside, same era.
A subspace minimization method for the trust-region step
J. B. Erway and P. E. Gill · 2009
Cited alongside, same era.
On solving trust-region and other regularised subproblems in optimization
N. I. M. Gould, D. P. Robinson, and H. S. Thorne · 2010
Cited alongside, same era.
A linear-time algorithm for trust region problems
E. Hazan and T. Koren · 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.
The power of normalization: Faster evasion of saddle points
K. Y. Levy · 2016
Closest in time.
Finding approximate local minima faster than gradient descent
N. Agarwal, Z. Allen-Zhu, B. Bullins, E. Hazan, and T. Ma · 2017
Closest in time.
On the generalized Lanczos trust-region method
L.-H. Zhang, C. Shen, and R.-C. Li · 2017
Closest in time.
Globally solving the trust region subproblem using simple first-order methods
A. Beck and Y. Vaisbourd · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Complexity bounds for second-order optimality in unconstrained optimization
C. Cartis, N. I. Gould, and P. L. Toint · 2012
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.
Escaping from saddle points—online stochastic gradient for tensor decomposition
R. Ge, F. Huang, C. Jin, and Y. Yuan · 2015
Cited alongside, same era.
Deep learning
Y. LeCun, Y. Bengio, and G. Hinton · 2015
Cited alongside, same era.
Randomized block Krylov methods for stronger and faster approximate singular value decomposition
C. Musco and C. Musco · 2015
Cited alongside, same era.
Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function-and derivative-evaluation complexity
C. Cartis, N. I. Gould, and P. L. Toint
Cited in the paper.
Optimization methods for large-scale learning
L. Bottou, F. Curtis, and J. Nocedal · 2018
Closest in time.
Accelerated methods for non-convex optimization
Y. Carmon, J. C. Duchi, O. Hinder, and A. Sidford · 2018
Closest in time.
Introductory lectures on stochastic convex optimization
J. C. Duchi · 2018
Closest in time.
Tight query complexity lower bounds for PCA via finite sample deformed Wigner law
M. Simchowitz, A. E. Alaoui, and B. Recht · 2018
Closest in time.