Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem: The Embedding Operator Q = F ∪ I of a Monotone LCP Is Maximal MonotoneResearch Paper
Many problems in optimization reduce to a linear complementarity problem over a cone: convex quadratic programs, linear and second-order cone programs, and more generally the KKT systems of convex quadratic cone programs (QCPs). First-order solvers for these problems, such as SCS (O'Donoghue–Chu–Parikh–Boyd 2016), must return either a solution or a…