V. Venkateswaran, AN ALGORITHM FOR THE LINEAR COMPLEMENTARITY-PROBLEM WITH A P(0)-MATRIX, SIAM journal on matrix analysis and applications, 14(4), 1993, pp. 967-977
This paper presents an algorithm for solving the linear complementarit
y problem (LCP) with a P0-matrix (i.e., a matrix with all principal mi
nors nonnegative). The method is based on solving a perturbed problem
for an arbitrarily small perturbation. To that end, a Bard-type algori
thm for performing computations with rational functions is developed.
The algorithm has been tested on random P0-matrix problems that are re
adily constructed. The results appear to bear out the viability of the
method.