1. Long steps in a O(n3L) algorithm for linear programming;Anstreicher,1988
2. Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function;Freund,1988
3. An O(√nL)-iteration large-step primal-dual affine algorithm for linear programming;Gonzaga,1989
4. A new polynomial-time algorithm for linear programming;Karmarkar;Combinatorica,1984
5. M. Kojima, N. Megiddo, and T. Noma, “Homotopy continuation methods for linear complementarity problems”, Dept. of Information Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro-Ka, Tokyo 152, Japan.