Answers are grounded in this paper and cite their sources.
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Approximate Karush–Kuhn–Tucker and approximate gradient projection conditions are analysed in this work. These conditions are not necessarily equivalent. Implications between different conditions and counter-examples will be shown. Algorithmic consequences will be discussed.
No takes yet. Share an insight, caveat, or question.
Andreani et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: