A necessary and sufficient condition for exact sparse recovery by _1 minimization

DOI10.1016/J.CRMA.2011.12.014zbMATH Open1236.94028OpenAlexW2077197393MaRDI QIDQ664941FDOQ664941

Authors: Charles Dossal 

Publication date: 5 March 2012

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2011.12.014

Recommendations

• On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
• The restricted isometry property and its implications for compressed sensing
• A new sufficient condition for sparse vector recovery via \(\ell_1\)-\( \ell_2\) local minimization
• On exact recovery of sparse vectors from linear measurements
• A note on guaranteed sparse recovery via \(\ell_1\)-minimization

zbMATH Keywords

\(\ell _{1}\)-penalized minimizationexact sparse recoverylinear measurement

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites Work

• Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
• Just relax: convex programming methods for identifying sparse signals in noise
• A numerical exploration of compressed sampling recovery
• On Sparse Representations in Arbitrary Redundant Bases
• Neighborliness of randomly projected simplices in high dimensions
• Near-ideal model selection by \(\ell _{1}\) minimization

Cited In (25)

• A power analysis for Model-X knockoffs with \(\ell_p\)-regularized statistics
• On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
• Sparsest representations and approximations of an underdetermined linear system
• Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization
• Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
• The generalized Lasso problem and uniqueness
• The Lasso problem and uniqueness
• One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
• Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
• Spark-level sparsity and the \(\ell_1\) tail minimization
• What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?
• A new sufficient condition for sparse vector recovery via \(\ell_1\)-\( \ell_2\) local minimization
• Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines
• Optimal dual certificates for noise robustness bounds in compressive sensing
• On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures
• Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
• The sparsity of LASSO-type minimizers
• In defense of the indefensible: a very naïve approach to high-dimensional inference
• \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
• An LP empirical quadrature procedure for parametrized functions
• Perfect Recovery Conditions for Non-negative Sparse Modeling
• On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
• Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions
• Thresholding gradient methods in Hilbert spaces: support identification and linear convergence
• A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization

This page was built for publication: A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q664941)