Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
From MaRDI portal
Publication:2885470
DOI10.1080/10556788.2011.602076zbMath1252.90061OpenAlexW2134971818WikidataQ58185690 ScholiaQ58185690MaRDI QIDQ2885470
Coralia Cartis, Nicholas I. M. Gould, Phillipe L. Toint
Publication date: 23 May 2012
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/work/54091
Related Items
Practical inexact proximal quasi-Newton method with global complexity analysis, A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization, On the worst-case evaluation complexity of non-monotone line search algorithms, Newton-type methods for non-convex optimization under inexact Hessian information, A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization, Implementable tensor methods in unconstrained convex optimization, Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models, Minimizing uniformly convex functions by cubic regularization of Newton method, On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization, Oracle complexity of second-order methods for smooth convex optimization, Linear-Time Convexity Test for Low-Order Piecewise Polynomials, Algebraic rules for quadratic regularization of Newton's method
Cites Work
- Unnamed Item
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Accelerating the cubic regularization of Newton's method on convex problems
- Cubic regularization of Newton method and its global performance
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
- Trust Region Methods
- Affine conjugate adaptive Newton methods for nonlinear elastomechanics
