SIAM Journal on Matrix Analysis and Applications · 1993 · 12 citations · 12 references
Natural SciencesComputer ScienceMathematicsAlgorithmsOptimizationTheory Of ComputationLinear AlgebraLinear ProgrammingMatrix ComputationNonlinear ProgrammingNumerical AlgorithmsNumerical Linear AlgebraComplementarity ProblemsComputational Linear AlgebraLinear Complementarity ProblemsMatrix Perturbation Theory
This paper presents an algorithm for solving the linear complementarily problem (LCP) with a $P_0 $-matrix (i.e., a matrix with all principal minors nonnegative). The method is based on solving a perturbed problem for an arbitrarily small perturbation. To that end, a Bard-type algorithm for performing computations with rational functions is developed. The algorithm has been tested on random $P_0 $-matrix problems that are readily constructed. The results appear to bear out the viability of the method.
12
Bimatrix Equilibrium Points and Mathematical Programming
C. E. Lemke · Management Science · 1965 · 1K citations · Full text
The Art of Computer Programming, Vol. 2
Donald E. Knuth · Medical Entomology and Zoology · 1981 · 863 citations
Computer algebra symbolic and algebraic computation
Bruno Buchberger, George E. Collins, Rüdiger Loos et al. · ACM SIGSAM Bulletin · 1982 · 393 citations · Full text