A shrinkage-thresholding projection method for sparsest solutions of LCPs

DOI10.1186/1029-242X-2014-51zbMath1307.90183WikidataQ59324206 ScholiaQ59324206MaRDI QIDQ2258766

Meijuan Shang, Cuiping Nie

Publication date: 26 February 2015

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

zbMATH Keywords

convergencelinear complementarity problemssparsest solutions\(l_1\) regularized minimizationshrinkage-thresholding operator

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game

Cites Work

• Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
• An EM algorithm for wavelet-based image restoration
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Stable signal recovery from incomplete and inaccurate measurements