Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming
Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming
复制标题
DOI：
10.1287/moor.1050.0150
复制
发表时间：
2005-11
期刊：
影响因子：
--
通讯作者：
G. Pillo;S. Lucidi;L. Palagi
中科院分区：
文献类型：
--
作者：
G. Pillo;S. Lucidi;L. Palagi
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 nonconvexity of the augmented Lagrangian function.
