Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models

Ernesto Birgin, John Gardenghi, José-Mario Martinez, Sandra Santos, Philippe Toint

Research output: Contribution to journalArticle

4 Downloads (Pure)

Abstract

The evaluation complexity of general nonlinear, possibly nonconvex,
constrained optimization is analyzed. It is shown that, under suitable
smoothness conditions, an $\epsilon$-approximate first-order critical
point of the problem can be computed in order $O(\epsilon^{1-2(p+1)/p})$ evaluations of the problem's function and their first $p$ derivatives. This is achieved by using a two-phases algorithm inspired by Cartis, Gould, and
Toint (2011, 2013). It is also shown that strong guarantees (in terms of handling degeneracies) on the possible limit points of the sequence of iterates generated by this algorithm can be obtained at the cost of increased complexity. At variance with previous results, the $\epsilon$-approximate first-order criticality is defined by satisfying a version of the KKT conditions with an accuracy that does not depend on the size of the Lagrange multipliers.
Original languageEnglish
Number of pages20
JournalSIAM Journal on Optimization
Volume26
Issue number2
Publication statusPublished - 2016

    Fingerprint

Keywords

  • Nonlinear optimization
  • Complexity theory
  • Constrained problems

Cite this