# Fast Solutions to Projective Monotone Linear Complementarity Problems

We present a new interior-point potential-reduction algorithm for solving monotone linear complementarity problems (LCPs) that have a particular special structure: their matrix $M\in{\mathbb R}^{n\times n}$ can be decomposed as $M=\Phi U + \Pi 0$, where the rank of $\Phi$ is \$k

Author: Geoffrey J. Gordon

Source: https://archive.org/