Journal title
Optimization Methods and Software
DOI
10.1080/10556788.2012.722632
Issue
3
Volume
28
Last updated
2023-12-21T07:32:03.31+00:00
Page
451-457
Abstract
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. © 2013 Copyright Taylor and Francis Group, LLC.
Symplectic ID
406733
Submitted to ORA
Off
Favourite
Off
Publication type
Journal Article
Publication date
01 Jun 2013