A half thresholding projection algorithm for sparse solutions of LCPs

被引:3
作者
Shang, Meijuan [1 ,2 ]
Zhang, Chao [1 ]
Peng, Dingtao [3 ]
Zhou, Shenglong [4 ]
机构
[1] Beijing Jiaotong Univ, Dept Appl Math, Beijing 100044, Peoples R China
[2] Shijiazhuang Univ, Dept Math, Shijiazhuang 050035, Peoples R China
[3] Guizhou Univ, Coll Sci, Guiyang 550025, Peoples R China
[4] Univ Southampton, Sch Math, Southampton SO17 1BJ, Hants, England
基金
中国国家自然科学基金;
关键词
Linear complementarity problems; Sparse solutions; l(1/2) regularized minimization; Half thresholding projection algorithm; Convergence;
D O I
10.1007/s11590-014-0834-7
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we aim to find sparse solutions of the linear complementarity problems (LCPs), which has many applications such as bimatrix games and portfolio selection. Mathematically, the underlying model is NP-hard in general. Thus, an regularized projection minimization model is proposed for relaxation. A half thresholding projection (HTP) algorithm is then designed for this regularization model, and the convergence of HTP algorithm is studied. Numerical results demonstrate that the HTP algorithm can effectively solve this regularization model and output very sparse solutions of LCPs with high quality.
引用
收藏
页码:1231 / 1245
页数:15
相关论文
共 21 条