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

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

Coralia Cartis, Nicholas I. M. Gould, 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 methods; smooth objective function with bounded range; worst-case evaluation

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming