Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions

DOI10.1007/s10107-010-0418-yzbMath1211.90332arXiv0904.0068OpenAlexW3103879072WikidataQ57392899 ScholiaQ57392899MaRDI QIDQ633107

Arkadi Nemirovski, Anatoli B. Juditsky, Fatma Kılınç-Karzan

Publication date: 31 March 2011

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0904.0068

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of mathematical programming (90C90) Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

\(s\)-goodness for low-rank matrix recovery, Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays, Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions, On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures, Partial \(S\)-goodness for partially sparse signal recovery, Sparse recovery on Euclidean Jordan algebras, Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications, On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery, The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement, Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals

Uses Software

• Mosek

Cites Work

• On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
• Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions
• Modelling of landslides with the material-point method
• On Lebesgue-type inequalities for greedy approximation
• Compressed sensing and best 𝑘-term approximation
• 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
• Uncertainty principles and ideal atomic decomposition
• Optimized Projections for Compressed Sensing
• Matching pursuits with time-frequency dictionaries
• Sparse nonnegative solution of underdetermined linear equations by linear programming
• Neighborliness of randomly projected simplices in high dimensions
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization