A half thresholding projection algorithm for sparse solutions of LCPs
From MaRDI portal
Publication:497459
DOI10.1007/s11590-014-0834-7zbMath1323.90071OpenAlexW2054624768MaRDI QIDQ497459
Meijuan Shang, Chao Zhang, Ding-Tao Peng, Sheng-Long Zhou
Publication date: 24 September 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0834-7
convergencelinear complementarity problemssparse solutions\(\ell_{1/2}\) regularized minimizationhalf thresholding projection algorithm
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal zero norm solutions of linear complementarity problems
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
- Exact matrix completion via convex optimization
- An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
- Optimal Cardinality Constrained Portfolio Selection
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Highly Robust Error Correction byConvex Programming
- Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- New reformulations for stochastic nonlinear complementarity problems
- Stable signal recovery from incomplete and inaccurate measurements
- Mathematical Programs with Equilibrium Constraints
- Compressed sensing
- Complementarity: applications, algorithms and extensions. Papers from the international conference on complementarity (ICCP 99), Madison, WI, USA, June 9--12, 1999
This page was built for publication: A half thresholding projection algorithm for sparse solutions of LCPs
