Second-order optimality and beyond: characterization and evaluation complexity in convexly-constrained nonlinear optimization
High-order optimality conditions for convexly-constrained nonlinear optimization problems are analyzed. A corresponding (expensive) measure of criticality for arbitrary order is proposed and extended to define high-order ∈-approximate critical points. This new measure is then used within a conceptua...
Main Authors: | Cartis, C, Gould, N, Toint, P |
---|---|
Format: | Journal article |
Published: |
Springer
2017
|
Similar Items
-
On the evaluation complexity of constrained nonlinear least-squares and general constrained nonlinear optimization using second-order methods
by: Cartis, C, et al.
Published: (2015) -
On the complexity of finding first-order critical points in constrained nonlinear optimization
by: Cartis, C, et al.
Published: (2012) -
Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization
by: Cartis, C, et al.
Published: (2016) -
Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
by: Cartis, C, et al.
Published: (2019) -
Complexity bounds for second-order optimality in unconstrained optimization.
by: Cartis, C, et al.
Published: (2012)