Fetching the paper…
Reading the bibliography…
The unconstrained minimization of a sufficiently smooth objective function $f(x)$ is considered, for which derivatives up to order $p$, $p\geq 2$, are assumed to be available.
Trust-Region Methods
A. R. Conn, N. I. M. Gould, and Ph. L. Toint · 2000
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
Yu. Nesterov and B. T. Polyak · 2006
Earlier work this paper cites.
Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results
C. Cartis, N. I. M. Gould, and Ph. L. Toint · 2011
Earlier work this paper cites.
Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function and derivative-evaluation complexity
C. Cartis, N. I. M. Gould, and Ph. L. Toint · 2011
Earlier work this paper cites.
Complexity bounds for second-order optimality in unconstrained optimization
C. Cartis, N. I. M. Gould, and Ph. L. Toint · 2012
Cited alongside, same era.
How much patience do you have? a worst-case perspective on smooth nonconvex optimization
C. Cartis, N. I. M. Gould, and Ph. L. Toint · 2012
Cited alongside, same era.
Second-order optimality and beyond: characterization and evaluation complexity in nonconvex convexly-constrained optimization
C. Cartis, N. I. M. Gould, and Ph. L. Toint · 2016
Cited alongside, same era.
Nonlinear stepsize control algorithms: Complexity bounds for first and second-order optimality
G.N. Grapiglia, J. Yuan, and Y. Yuan · 2016
Cited alongside, same era.
Gradient descent efficiently finds the cubic-regularized nonconvex Newton step
Y. Carmon and J. C. Duchi · 2016
Cited alongside, same era.
A trust region algorithm with a worst-case iteration complexity of
F. E. Curtis, D. P. Robinson, and M. Samadi
Cited in the paper.
Finding approximate local minima faster than gradient descent
N. Agarwal, Z. Allen-Zhu, B. Bullins, E. Hazan and T. Ma · 2016
Later among the works it cites.
Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
J. M. Martínez and M. Raydan · 2016
Later among the works it cites.
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
E.G. Birgin, J.L. Gardenghi, J.M. Martínez, S.A. Santos, and Ph. L. Toint · 2017
Closest in time.
The use of quadratic regularization with a cubic descent condition for unconstrained optimization
E.G. Birgin and J.M. Martínez · 2017
Closest in time.
A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
S. Gratton, C. W. Royer, and L. N. Vicente · 2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…