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

Coralia Cartis, Nicholas I M Gould, Philippe L. Toint

Résultats de recherche: Contribution à un journal/une revueArticle

5 Downloads (Pure)

Résumé

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.

langue originaleAnglais
Pages (de - à)451-457
Nombre de pages7
journalOptimization Methods and Software
Volume28
Numéro de publication3
Les DOIs
étatPublié - 1 juin 2013

Empreinte digitale

Chebyshev
Nonconvex Optimization
Nonconvex Problems
Resolve
Lower bound
Optimization Problem
First-order
Iteration

Citer ceci

@article{53354db12c8843d8be7ec140b0c43392,
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 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 = "evaluation complexity, nonconvex optimization, worst-case analysis",
author = "Coralia Cartis and Gould, {Nicholas I M} and Toint, {Philippe L.}",
year = "2013",
month = "6",
day = "1",
doi = "10.1080/10556788.2012.722632",
language = "English",
volume = "28",
pages = "451--457",
journal = "Optimization Methods and Software",
issn = "1055-6788",
publisher = "Taylor & Francis",
number = "3",

}

A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function. / Cartis, Coralia; Gould, Nicholas I M; Toint, Philippe L.

Dans: Optimization Methods and Software, Vol 28, Numéro 3, 01.06.2013, p. 451-457.

Résultats de recherche: Contribution à un journal/une revueArticle

TY - JOUR

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

AU - Cartis, Coralia

AU - Gould, Nicholas I M

AU - Toint, Philippe L.

PY - 2013/6/1

Y1 - 2013/6/1

N2 - 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.

AB - 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.

KW - evaluation complexity

KW - nonconvex optimization

KW - worst-case analysis

UR - http://www.scopus.com/inward/record.url?scp=84878316454&partnerID=8YFLogxK

U2 - 10.1080/10556788.2012.722632

DO - 10.1080/10556788.2012.722632

M3 - Article

VL - 28

SP - 451

EP - 457

JO - Optimization Methods and Software

JF - Optimization Methods and Software

SN - 1055-6788

IS - 3

ER -