摘要

This paper considers a class of stochastic linear complementarity problems (SLCPs) with finitely many realizations. We first formulate this class of SLCPs as a minimization problem. Then, a partial projected Newton method, which yields a stationary point of the minimization problem, is presented. The global and quadratic convergence of the proposed method is proved under certain assumptions. Preliminary experiments show that the algorithm is efficient and the formulation may yield a solution with various desirable properties.