Uniqueness of the minimal l₁-norm solution to the monotone linear complementarity problem
DOI10.1155/2017/7175385zbMATH Open1426.90241OpenAlexW2569074628WikidataQ59147741 ScholiaQ59147741MaRDI QIDQ1993073FDOQ1993073
Authors: Yanyan Li 
Publication date: 5 November 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/7175385
Recommendations
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Atomic Decomposition by Basis Pursuit
- Decoding by Linear Programming
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing and best \(k\)-term approximation
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Neighborliness of randomly projected simplices in high dimensions
- Entropy function-based algorithms for solving a class of nonconvex minimization problems
- Engineering and Economic Applications of Complementarity Problems
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
- Sparse solutions of linear complementarity problems
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- Randomized portfolio selection, with constraints
- Minimal zero norm solutions of linear complementarity problems
- The sparsest solution to the system of absolute value equations
Cited In (5)
- A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game
- Sparse solutions of linear complementarity problems
- A shrinkage-thresholding projection method for sparsest solutions of LCPs
- Minimal zero norm solutions of linear complementarity problems
- A note on the unique solution of linear complementarity problem
Uses Software
This page was built for publication: Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1993073)
