Newton Hard Thresholding Pursuit for Sparse LCP via A New Merit Function

Shenglong Zhou, Meijuan Shang, Lili Pan +1

Solutions to the linear complementarity problem (LCP) are naturally sparse in many applications such as bimatrix games and portfolio section problems. Despite that it gives rise to…