Journal article icon

Journal article

A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function.

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.

Actions


Access Document


Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Mathematical Inst
Gould, NIM More by this author
Journal:
Optimization Methods and Software
Volume:
28
Issue:
3
Pages:
451-457
Publication date:
2013
DOI:
EISSN:
1029-4937
ISSN:
1055-6788
URN:
uuid:a1e11b53-f249-4dc1-b193-b74400df960b
Source identifiers:
406733
Local pid:
pubs:406733

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP