WORST-CASE EVALUATION COMPLEXITY AND OPTIMALITY OF SECOND-ORDER METHODS FOR NONCONVEX SMOOTH OPTIMIZATION

DOI10.1142/9789813272880_0198zbMath1451.90177arXiv1709.07180OpenAlexW2972602190MaRDI QIDQ5122174

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

Publication date: 22 September 2020

Published in: Proceedings of the International Congress of Mathematicians (ICM 2018) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.07180

zbMATH Keywords

nexact second-order methodssmooth objective function with bounded rangeworst-case evaluation

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items

Lower bounds for non-convex stochastic optimization, An adaptive regularization method in Banach spaces, A note on solving nonlinear optimization problems in variable precision, A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees, Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound, Lower bounds for finding stationary points I, Lower bounds for finding stationary points II: first-order methods, High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms, Adaptive regularization with cubics on manifolds, Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints, Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization