A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
References (15)
Long steps in a O(n3L) algorithm for linear programming
(1988)Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- et al.
An O(√nL)-iteration large-step primal-dual affine algorithm for linear programming
A new polynomial-time algorithm for linear programming
Combinatorica
(1984)- M. Kojima, N. Megiddo, and T. Noma, “Homotopy continuation methods for linear complementarity problems”, Dept. of...
- et al.
An interior point potential reduction algorithm for the linear complementarity problem
(1988) - et al.
A primal-dual interior point algorithm for linear programming
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 1991 Published by Elsevier B.V.