Abstract
This paper identifies necessary and sufficient conditions for a penalty method to yield an optimal solution or a Lagrange multiplier of a convex programming problem by means of a single unconstrained minimization. The conditions are given in terms of properties of the objective and constraint functions of the problem as well as the penalty function adopted. It is shown among other things that all linear programs with finite optimal value satisfy such conditions when the penalty function is quadratic.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 87-99 |
| Number of pages | 13 |
| Journal | Mathematical Programming |
| Volume | 9 |
| Issue number | 1 |
| DOIs | |
| State | Published - Dec 1975 |
| Externally published | Yes |
ASJC Scopus subject areas
- Software
- Mathematics(all)