On the local quadratic convergence of the primal–dual augmented Lagrangian method
- 8 May 2009
- journal article
- research article
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 24 (3) , 369-379
Abstract
We consider a primal–dual augmented Lagrangian (PDAL) method for optimization problems with equality constraints. Each step of the PDAL requires solving the primal–dual (PD) linear system of equations. We show that under the standard second-order optimality condition the PDAL method generates a sequence, which locally converges to the PD solution with quadratic rate.Keywords
This publication has 11 references indexed in Scilit:
- Primal–dual exterior point method for convex optimizationOptimization Methods and Software, 2008
- Nonlinear Rescaling as Interior Quadratic Prox Method in Convex OptimizationComputational Optimization and Applications, 2006
- Primal-dual nonlinear rescaling method with dynamic scaling parameter updateMathematical Programming, 2005
- Introductory Lectures on Convex Optimization2004
- A superlinearly convergent primal — dual algorithm model for constrained optimization problems with bounded variablesOptimization Methods and Software, 2000
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problemsJournal of Optimization Theory and Applications, 1995
- Nonlinear Programming1990
- A new augmented Lagrangian function for inequality constraints in nonlinear programming problemsJournal of Optimization Theory and Applications, 1982
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex ProgrammingMathematics of Operations Research, 1976
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969