1Clovis C. Gonzaga. Polynomial affine algorithms for linear programming[J] 1990,Mathematical Programming(1-3):7～21
2Irvin J. Lustig. Feasibility issues in a primal-dual interior-point method for linear programming[J] 1990,Mathematical Programming(1-3):145～162
3D. Goldfarb,S. Liu. An O(n 3 L) primal interior point algorithm for convex quadratic programming[J] 1990,Mathematical Programming(1-3):325～340
4Yinyu Ye,Michael J. Todd. Containing and shrinking ellipsoids in the path-following algorithm[J] 1990,Mathematical Programming(1-3):1～9
5A. Dax. The smallest point of a polytope[J] 1990,Journal of Optimization Theory and Applications(2):429～432
6C. Roos. New trajectory-following polynomial-time algorithm for linear programming problems[J] 1989,Journal of Optimization Theory and Applications(3):433～458
7Y. Ye. Eliminating columns in the simplex method for linear programming[J] 1989,Journal of Optimization Theory and Applications(1):69～77
8F. A. Lootsma. A comparative study of primal and dual approaches for solving separable and partially-separable nonlinear optimization problems[J] 1989,Structural Optimization(2):73～79
9Masakazu Kojima,Shinji Mizuno,Akiko Yoshise. A polynomial-time algorithm for a class of linear complementarity problems[J] 1989,Mathematical Programming(1-3):1～26
10Renato D. C. Monteiro,Ilan Adler. Interior path following primal-dual algorithms. part I: Linear programming[J] 1989,Mathematical Programming(1-3):27～41
