An interior point potential reduction algorithm for the linear complementarity problem
- 1 February 1992
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 54 (1) , 267-279
- https://doi.org/10.1007/bf01586054
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An O(n 3 L) potential reduction algorithm for linear programmingMathematical Programming, 1991
- Polynomial affine algorithms for linear programmingMathematical Programming, 1990
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- The Jacobian matrix and global univalence of mappingsMathematische Annalen, 1965