An algorithm for the linear complementarity problem with upper and lower bounds
- 1 July 1989
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 62 (1) , 151-163
- https://doi.org/10.1007/bf00939635
Abstract
No abstract availableKeywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Even more with the Lemke complementarity algorithmMathematical Programming, 1986
- Algorithms for the Linear Complementarity Problem Which Allow an Arbitrary Starting PointPublished by Springer Nature ,1983
- The octahedral algorithm, a new simplicial fixed point algorithmMathematical Programming, 1981
- A class of simplicial restart fixed point algorithms without an extra dimensionMathematical Programming, 1981
- A Modified Integer Labeling for Complementarity AlgorithmsMathematics of Operations Research, 1981
- Bimatrix Equilibrium Points and Mathematical ProgrammingManagement Science, 1965