How much patience do you have? A worst-case perspective on smooth nonconvex optimization Published: 2012/09/09 Coralia CartisNicholas I. M. GouldPhilippe L. TointCategories Constrained Nonlinear Optimization, Nonlinear Systems and Least-Squares, Unconstrained Optimization Tags complexity, nonlinear optimization, worst-case Short URL: https://optimization-online.org/?p=12159 The paper presents a survey of recent results in the field of worst-case complexity of algorithms for nonlinear (and possibly nonconvex) smooth optimization. Both constrained and unconstrained case are considered. ArticleDownload View PDF