Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
Evaluation complexity for convexly constrained optimization is considered and it is shown first that the complexity bound of O(∈−3/2) proved by Cartis, Gould and Toint (IMAJNA 32(4) 2012, pp.1662-1695) for computing an ∈-approximate first-order critical point can be obtained under significantly weak...
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Published: |
Springer
2019
|