Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's
- 1 October 1983
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 26 (3) , 316-325
- https://doi.org/10.1007/bf02591869
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the computational complexity of piecewise-linear homotopy algorithmsMathematical Programming, 1982
- Completely- matricesMathematical Programming, 1980
- A variable dimension algorithm for the linear complementarity problemMathematical Programming, 1980
- Computational complexity of complementary pivot methodsPublished by Springer Nature ,1978
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- Bimatrix Equilibrium Points and Mathematical ProgrammingManagement Science, 1965