Projects per year
Abstract / Description of output
This short note considers and resolves the apparent contradiction between known worst-case complexity results for first- and second-order methods for solving unconstrained smooth nonconvex optimization problems and a recent note by Jarre [On Nesterov's smooth Chebyshev-Rosenbrock function, Optim. Methods Softw. (2011)] implying a very large lower bound on the number of iterations required to reach the solution's neighbourhood for a specific problem with variable dimension.
Keywords / Materials (for Non-textual outputs)
- evaluation complexity
- worst-case analysis
- nonconvex optimization
- UNCONSTRAINED OPTIMIZATION
FingerprintDive into the research topics of 'A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function'. Together they form a unique fingerprint.
- 1 Finished
1/09/11 → 30/09/13