Uniqueness of the minimal l₁-norm solution to the monotone linear complementarity problem
Summary: The linear complementarity problem (LCP) has wide applications in economic equilibrium, operations research, and so on, which attracted a lot of interest of experts. Finding the sparsest solution to the LCP has real applications in the field of portfolio selection and bimatrix game. Motivated by the approach developed in compressive sensing, we may try to solve an \(l_1\)-minimization problem to obtain the sparsest solution to the LCP, where an important theoretical problem is to investigate uniqueness of the solution to the concerned \(l_1\)-minimization problem. In this paper, we investigate the problem of finding the minimal \(l_1\)-norm solution to the monotone LCP and propose a sufficient and necessary condition for the uniqueness of the minimal \(l_1\)-norm solution to the monotone LCP, which provides an important theoretical basis for finding the sparsest solution to the monotone LCP via solving the corresponding \(l_1\)-minimization problem. Furthermore, several examples are given to confirm our theoretical finding.
- Atomic Decomposition by Basis Pursuit
- Compressed sensing and best \(k\)-term approximation
- Decoding by Linear Programming
- Engineering and Economic Applications of Complementarity Problems
- Entropy function-based algorithms for solving a class of nonconvex minimization problems
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- Minimal zero norm solutions of linear complementarity problems
- Neighborliness of randomly projected simplices in high dimensions
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- Randomized portfolio selection, with constraints
- Restricted p-Isometry Properties of Nonconvex Matrix Recovery
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- RSP-Based Analysis for Sparsest and Least \ell₁-Norm Solutions to Underdetermined Linear Systems
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- Sparse solutions of linear complementarity problems
- The sparsest solution to the system of absolute value equations
- A shrinkage-thresholding projection method for sparsest solutions of LCPs
- Sparse solutions of linear complementarity problems
- Minimal zero norm solutions of linear complementarity problems
- A note on the unique solution of linear complementarity problem
- A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game
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)
