A Primal-Dual Augmented Lagrangian
Philip E. Gill and Daniel P. Robinson abstract
Nonlinearly constrained optimization problems can be solved by minimizing a sequence of simpler unconstrained or linearly constrained subproblems. In this paper, we discuss the formulation of subproblems in which the objective is a primal-dual generalization of the Hestenes-Powell augmented Lagrangian function. This generalization has the crucial feature that it is minimized with respect to both the primal and the dual variables simultaneously. A benefit of this approach is that the quality of the dual variables is monitored explicitly during the solution of the subproblem. Moreover, each subproblem may be regularized by imposing explicit bounds on the dual variables. Two primal-dual variants of conventional primal methods are proposed: a primal-dual bound constrained Lagrangian (pdBCL) method and a primal-dual \ell1 linearly constrained Lagrangian (pd\ell1-LCL) method.
infoinstitution | Oxford University Computing Laboratory |
month | May |
number | NA-08/05 |
year | 2008 |
links
BibTeX
Download (pdf)
related pages
|
