Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization

C. Cartis, Phillipe Rodrigues Sampaio, Ph L. Toint

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

32 Téléchargements (Pure)


The worst-case evaluation complexity of finding an approximate first-order critical point using gradient-related non-monotone methods for smooth non-convex and unconstrained problems is investigated. The analysis covers a practical linesearch implementation of these popular methods, allowing for an unknown number of evaluations of the objective function (and its gradient) per iteration. It is shown that this class of methods shares the known complexity properties of a simple steepest-descent scheme and that an approximate first-order critical point can be computed in at most (Formula presented.) function and gradient evaluations, where (Formula presented.) is the user-defined accuracy threshold on the gradient norm.

langue originaleAnglais
Pages (de - à)1349-1361
Nombre de pages13
Numéro de publication5
Les DOIs
Etat de la publicationPublié - 4 mai 2015

    Empreinte digitale

Contient cette citation