Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
From MaRDI portal
Publication:489110
DOI10.1007/s40305-014-0043-1zbMath1308.90100arXiv1312.4163OpenAlexW2025482263MaRDI QIDQ489110
Publication date: 27 January 2015
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.4163
linear programmingstrict complementarityunderdetermined linear systemnonuniform recoveryrange space propertysparsest nonnegative solutionuniform recovery
Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Sampling theory in information and communication theory (94A20)
Related Items
A survey on compressive sensing: classical results and recent advancements ⋮ 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory ⋮ Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained ℓ1 minimization ⋮ Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming ⋮ \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization ⋮ Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets ⋮ Stability analysis of a class of sparse optimization problems ⋮ Optimality analysis on partial \(l_1\)-minimization recovery ⋮ Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem ⋮ Weak Stability of ℓ1-Minimization Methods in Sparse Data Reconstruction ⋮ Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems ⋮ Uniqueness Conditions for A Class of ℓ0-Minimization Problems ⋮ The sparsest solution to the system of absolute value equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
- An approximation theory of matrix rank minimization and its application to quadratic equations
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- The restricted isometry property and its implications for compressed sensing
- Parsimonious least norm approximation
- The use of the optimal partition in a linear programming solution for postoptimal analysis
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- Nonnegative matrix factorization for spectral data analysis
- Nonuniform sparse recovery with subgaussian matrices
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- On Sparse Representations in Arbitrary Redundant Bases
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Sparse representations in unions of bases
- Greed is Good: Algorithmic Results for Sparse Approximation
- Sparse and Redundant Representations
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Iteratively reweighted least squares minimization for sparse recovery
- An analysis of degeneracy
- Minimum-support solutions of polyhedral concave programs*
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
- A generalized uncertainty principle and sparse representation in pairs of bases
- On sparse representation in pairs of bases
- Sparse Approximate Solutions to Linear Systems
- Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
- Mathematical Programming for Data Mining: Formulations and Challenges
- Learning the parts of objects by non-negative matrix factorization
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Covariance-Preconditioned Iterative Methods for Nonnegatively Constrained Astronomical Imaging
- Compressed sensing
This page was built for publication: Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
