A parallel algorithm for solving the linear complementarity problem
- 1 December 1988
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 14 (1) , 77-104
- https://doi.org/10.1007/bf02186475
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Global Optimization Approach to the Linear Complementarity ProblemSIAM Journal on Scientific and Statistical Computing, 1988
- POLYNOMIALLY BOUNDED ELLIPSOID ALGORITHMS FOR CONVEX QUADRATIC PROGRAMMING11Research effort partially supported by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under grant No. AFOSR 78-3646. The United States Government is authorized to reproduce and distribute reprints for governmental purposes, notwithstanding any copyright notation hereon.Published by Elsevier ,1981
- A variable dimension algorithm for the linear complementarity problemMathematical Programming, 1980
- Characterization of linear complementarity problems as linear programsPublished by Springer Nature ,1978
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- Bimatrix Equilibrium Points and Mathematical ProgrammingManagement Science, 1965