Article ID: | iaor1991280 |
Country: | United States |
Volume: | 15 |
Start Page Number: | 408 |
End Page Number: | 422 |
Publication Date: | Nov 1990 |
Journal: | Mathematics of Operations Research |
Authors: | Monteiro Renato D.C., Adler Ilan |
The authors describe a primal-dual interior point algorithm for a class of convex separable programming problems subject to linear constraints. Each iteration updates a penalty parameter and finds a Newton step associated with the Karush-Kuhn-Tucker system of equations which characterizes a solution of the logarithmic barrier function problem for that parameter. It is shown that the duality gap is reduced at each iteration by a factor of