An extension of the potential reduction algorithm for linear complementarity problems with some priority goals
- 1 November 1993
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 193, 35-50
- https://doi.org/10.1016/0024-3795(93)90270-x
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On Anstreicher's combined phase I—phase II projective algorithm for linear programmingMathematical Programming, 1992
- An interior point potential reduction algorithm for the linear complementarity problemMathematical Programming, 1992
- Homotopy Continuation Methods for Nonlinear Complementarity ProblemsMathematics of Operations Research, 1991
- Comparative analysis of affine scaling algorithms based on simplifying assumptionsMathematical Programming, 1991
- An O(n 3 L) potential reduction algorithm for linear programmingMathematical Programming, 1991
- A Centered Projective Algorithm for Linear ProgrammingMathematics of Operations Research, 1990
- An Implementation of a Primal-Dual Interior Point Method for Linear ProgrammingINFORMS Journal on Computing, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A combined phase I-phase II projective algorithm for linear programmingMathematical Programming, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984