Necessary Optimality Conditions for Nonlinear Programming are discussed in the present research. A new Second-Order condition is given, which depends on a weak constant rank constraint requirement. We show that practical and publicly available algorithms (www.ime.usp.br/~egbirgin/tango) of Augmented Lagrangian type converge, after slight modifications, to stationary points defined by the new condition.
Article
View On Second-Order Optimality Conditions for Nonlinear Programming