An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems
- 1 March 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 50 (1-3), 331-342
- https://doi.org/10.1007/bf01594942
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- An interior point potential reduction algorithm for the linear complementarity problemMathematical Programming, 1992
- Homotopy Continuation Methods for Nonlinear Complementarity ProblemsMathematics of Operations Research, 1991
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- Interior path following primal-dual algorithms. part II: Convex quadratic programmingMathematical Programming, 1989
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- A variant of Karmarkar's linear programming algorithm for problems in standard formMathematical Programming, 1987
- A variation on Karmarkar’s algorithm for solving linear programming problemsMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984