论文信息 - Iterative linear programming solution of convex programs

Iterative linear programming solution of convex programs

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.

M. Ferris

[1] H. H. Rosenbrock,et al. An Automatic Method for Finding the Greatest or Least Value of a Function , 1960, Comput. J..

[2] Olvi L. Mangasarian,et al. Nonlinear Programming , 1969 .

[3] David Mautner Himmelblau,et al. Applied Nonlinear Programming , 1972 .

[4] Olvi L. Mangasarian,et al. Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems , 1976, Math. Program..

[5] Shih-Ping Han,et al. Superlinearly convergent variable metric algorithms for general nonlinear programming problems , 1976, Math. Program..

[6] M. J. D. Powell,et al. THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS , 1978 .

[7] N. Josephy. Newton's Method for Generalized Equations. , 1979 .

[8] N. Josephy. Quasi-Newton methods for generalized equations , 1979 .

[9] Stephen M. Robinson,et al. Strongly Regular Generalized Equations , 1980, Math. Oper. Res..

[10] Jong-Shi Pang,et al. Inexact Newton methods for the nonlinear complementarity problem , 1986, Math. Program..