A primal-dual interior point method whose running time depends only on the constraint matrix

This publication has 29 references indexed in Scilit:

• Interior-Point Polynomial Algorithms in Convex Programming
  Published by Society for Industrial & Applied Mathematics (SIAM) ,1994
• A Short-Cut Potential Reduction Algorithm for Linear Programming
  Management Science, 1993
• Path-Following Methods for Linear Programming
  SIAM Review, 1992
• Computational experience with a primal-dual interior point method for linear programming
  Linear Algebra and its Applications, 1991
• A geometric property of the least squares solution of linear equations
  Linear Algebra and its Applications, 1990
• A polynomial-time algorithm for a class of linear complementarity problems
  Mathematical Programming, 1989
• Pathways to the Optimal Set in Linear Programming
  Published by Springer Nature ,1989
• A new polynomial-time algorithm for linear programming
  Combinatorica, 1984
• An analogue of Moreau’s proximation theorem, with application to the nonlinear complementarity problem
  Pacific Journal of Mathematics, 1980
• Systems of distinct representatives and linear algebra
  Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967