We define a primal-dual algorithm model (second-order Lagrangian algorithm, SOLA) for inequality constrained optimization problems that generates a sequence converging to points satisfying the second-order necessary conditions for optimality. This property can be enforced by combining the equivalence between the original constrained problem and the unconstrained minimization of an exact augmented Lagrangian function and the use of a curvilinear line search technique that exploits information on the non convexity of the augmented Lagrangian function.
Convergence to 2-nd order stationary points of a primal-dual algorithm model for nonlinear programming / DI PILLO, Gianni; Lucidi, Stefano; Palagi, Laura. - In: MATHEMATICS OF OPERATIONS RESEARCH. - ISSN 0364-765X. - STAMPA. - 30:(2005), pp. 897-915. [10.1287/moor.1050.0150]
Convergence to 2-nd order stationary points of a primal-dual algorithm model for nonlinear programming
DI PILLO, Gianni;LUCIDI, Stefano;PALAGI, Laura
2005
Abstract
We define a primal-dual algorithm model (second-order Lagrangian algorithm, SOLA) for inequality constrained optimization problems that generates a sequence converging to points satisfying the second-order necessary conditions for optimality. This property can be enforced by combining the equivalence between the original constrained problem and the unconstrained minimization of an exact augmented Lagrangian function and the use of a curvilinear line search technique that exploits information on the non convexity of the augmented Lagrangian function.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.