Nearest Points in Nonsimplicial Cones and LCP's with PSD Symmetric Matrices

We discuss conditions for the equivalence of a linear complementary problem (LCP) with a positive semidefinite (PSD) symmetric matrix to a nearest point problem over a Pos cone. We then develop an algorithm for this nearest point problem, and report on its computational performance.