On sequential optimality conditions for smooth constrained optimization
Roberto Andreani, Gabriel Haeser, José Mario Martínez · Optimization · 2011
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.