The open archive for STFC research publications

You may experience service outages on ePubs over the coming days due to work being carried out to enhance our network infrastructure. The service should be considered at risk from 23/11 - 03/12.

Full Record Details

DOI 10.5286/raltr.2011016
Persistent URL http://purl.org/net/epubs/work/60837
Record Status Checked
Record Id 60837
Title 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 worstcase complexity results for first and second-order methods for solving unconstrained smooth nonconvex optimization problems and a recent note by Jarre (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.
Organisation CSE , CSE-NAG , STFC
Funding Information
Related Research Object(s):
Licence Information:
Language English (EN)
Type Details URI(s) Local file(s) Year
Report RAL Technical Reports RAL-TR-2011-016. 2011. RAL-TR-2011-016.pdf 2011