Complexity bounds for second-order optimality in unconstrained optimization

This publication has 10 references indexed in Scilit:

• On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
  SIAM Journal on Optimization, 2010
• Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results
  Mathematical Programming, 2009
• Trust-region and other regularisations of linear least-squares problems
  BIT Numerical Mathematics, 2009
• Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
  SIAM Journal on Optimization, 2008
• Affine conjugate adaptive Newton methods for nonlinear elastomechanics
  Optimization Methods and Software, 2007
• Accelerating the cubic regularization of Newton’s method on convex problems
  Mathematical Programming, 2007
• Cubic regularization of Newton method and its global performance
  Mathematical Programming, 2006
• Introductory Lectures on Convex Optimization
  2004
• Black-Box Complexity of Local Minimization
  SIAM Journal on Optimization, 1993
• Approximation algorithms for indefinite quadratic programming
  Mathematical Programming, 1992