Iterative linear programming solution of convex programs |
| |
Authors: | M C Ferris |
| |
Institution: | (1) Computer Sciences Department, University of Wisconsin, Madison, Wisconsin |
| |
Abstract: | An iterative linear programming algorithm for the solution of the convex programming problem is proposed. The algorithm partially solves a sequence of linear programming subproblems whose solution is shown to converge quadratically, superlinearly, or linearly to the solution of the convex program, depending on the accuracy to which the subproblems are solved. The given algorithm is related to inexact Newton methods for the nonlinear complementarity problem. Preliminary results for an implementation of the algorithm are given.This material is based on research supported by the National Science Foundation, Grants DCR-8521228 and CCR-8723091, and by the Air Force Office of Scientific Research, Grant AFOSR-86-0172. The author would like to thank Professor O. L. Mangasarian for stimulating discussions during the preparation of this paper. |
| |
Keywords: | Iterative linear programming complementarity problems inexact Newton methods finite termination |
本文献已被 SpringerLink 等数据库收录! |
|