A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function
From MaRDI portal
Publication:5299905
DOI10.1080/10556788.2012.722632zbMath1273.90199OpenAlexW2146893335WikidataQ58185673 ScholiaQ58185673MaRDI QIDQ5299905
Nicholas I. M. Gould, Coralia Cartis, Phillipe L. Toint
Publication date: 24 June 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2012.722632
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)
Related Items
Lower bounds for finding stationary points I, On the complexity of finding first-order critical points in constrained nonlinear optimization
Cites Work
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
- Complexity bounds for second-order optimality in unconstrained optimization
- Worst case complexity of direct search
- Cubic regularization of Newton method and its global performance
- On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- Black-Box Complexity of Local Minimization
