Uniqueness of the minimal l₁-norm solution to the monotone linear complementarity problem

DOI10.1155/2017/7175385MaRDI QIDQ1993073zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 5 November 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2017/7175385

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Sparse solutions of linear complementarity problems
• Minimal zero norm solutions of linear complementarity problems
• A shrinkage-thresholding projection method for sparsest solutions of LCPs
• A note on the unique solution of linear complementarity problem
• scientific article; zbMATH DE number 7668284

Cites work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• 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
• 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
• RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
• Randomized portfolio selection, with constraints
• Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sparse Recovery of Nonnegative Signals With Minimal Expansion
• Sparse solutions of linear complementarity problems
• The sparsest solution to the system of absolute value equations

Cited in

(5)

• A shrinkage-thresholding projection method for sparsest solutions of LCPs
• Sparse solutions of linear complementarity problems
• A note on the unique solution of linear complementarity problem
• Minimal zero norm solutions of linear complementarity problems
• A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game

Describes a project that uses

Uses Software

• PDCO

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)