The Slacked Unconstrained Minimization Technique for Convex Programming
Authors:
- Anthony V. FiaccoAFAnthony V. Fiacco
- Garth P. McCormickGMGarth P. McCormick
- 1 May 1967
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 15 (3) , 505-515
Abstract
An algorithm for solving the problem: minimize $f( x )$ (a convex function) subject to $g_i ( x )\geqq 0$, $i = 1, \cdots ,m$, each $g_i $ a concave function, is presented. Specifically, the function \[ P\left[ {x,t,r_k } \right] \equiv f( x ) + r_k^{ - 1} \sum {\left[ {g_i ( x ) - t_i } \right]} ^2 \] is minimized over all x, nonnegative t, for a strictly decreasing null sequence $\{ {r_k } \}$. This extends the work of T. Pietrzykowski [5]. It is proved that for every $r_k > 0$, there exists a finite point $[ {x( {r_k } ),t( {r_k } )} ]$ which minimizes P, and which solves the convex programming problem as $r_k \to 0$. This algorithm is similar to the Sequential Unconstrained Minimization Technique (SUMT) [1] in that it solves the (Wolfe) dual programming problem [6]. It differs from SUMT in that (1) it approaches the optimum from the region of infeasibility (i.e., it is a relaxation technique), (2) it does not require a nonempty interior to the nonlinearly constrained region, (3) no separate feasibility phase is required before optimization takes place, (4) the computational effort per iteration is reduced.
Keywords
This publication has 5 references indexed in Scilit:
- A Note on the Sequential Unconstrained Minimization Technique for Non-Linear ProgrammingManagement Science, 1965
- The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual MethodManagement Science, 1964
- A duality theorem for non-linear programmingQuarterly of Applied Mathematics, 1961
- Letter to the Editor—Inequality-Constrained Stationary-Value ProblemsJournal of the Operations Research Society of America, 1955
- Nonlinear Programming1951