A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function
From MaRDI portal
Recommendations
- On Nesterov's smooth Chebyshev-Rosenbrock function
- On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
- A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth 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
- Black-Box Complexity of Local Minimization
- Complexity bounds for second-order optimality in unconstrained optimization
- Cubic regularization of Newton method and its global performance
- On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- Worst case complexity of direct search
Cited in
(4)
This page was built for publication: A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5299905)
