Minimal Zero Norm Solutions of Linear Complementarity Problems

作者：Shang Meijuan; Zhang Chao^*; Xiu Naihua

来源：Journal of Optimization Theory and Applications, 2014, 163(3): 795-814.

DOI：10.1007/s10957-014-0549-z

• Minimal
• l(0) norm solutions
• Linear complementarity problems
• Z-Matrix
• l(p) regularized minimization
• Sequential smoothing gradient method

In this paper, we study minimal zero norm solutions of the linear complementarity problems, defined as the solutions with smallest cardinality. Minimal zero norm solutions are often desired in some real applications such as bimatrix game and portfolio selection. We first show the uniqueness of the minimal zero norm solution for Z-matrix linear complementarity problems. To find minimal zero norm solutions is equivalent to solve a difficult zero norm minimization problem with linear complementarity constraints. We then propose a p norm regularized minimization model with p in the open interval from zero to one, and show that it can approximate minimal zero norm solutions very well by sequentially decreasing the regularization parameter. We establish a threshold lower bound for any nonzero entry in its local minimizers, that can be used to identify zero entries precisely in computed solutions. We also consider the choice of regularization parameter to get desired sparsity. Based on the theoretical results, we design a sequential smoothing gradient method to solve the model. Numerical results demonstrate that the sequential smoothing gradient method can effectively solve the regularized model and get minimal zero norm solutions of linear complementarity problems.

• 出版日期2014-12