Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $\chi$

Coralia Cartis, Nick Gould, Philippe L Toint

Evaluation complexity for convexly constrained optimization is considered and it is shown first that the complexity bound of $O({\epsilon }^{-3/2})$ proved by Cartis, Gould and Toint (IMAJNA…