A note on guaranteed sparse recovery via _1-minimization

DOI10.1016/J.ACHA.2009.10.004zbMATH Open1198.41011OpenAlexW2076684473MaRDI QIDQ984666FDOQ984666

Authors: Simon Foucart 

Publication date: 20 July 2010

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2009.10.004

Recommendations

• Recovery of sparsest signals via \(\ell^q \)-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
• Consistency of \(\ell_1\) recovery from noisy deterministic measurements

zbMATH Keywords

compressive sensing\(\ell_1\)-minimizationrestricted isometry constants

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation with constraints (41A29)

Cites Work

• Decoding by Linear Programming
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Sparse representations in unions of bases
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• The restricted isometry property and its implications for compressed sensing
• Shifting Inequality and Recovery of Sparse Signals

Cited In (53)

• Compressive Sensing
• Sparse Legendre expansions via \(\ell_1\)-minimization
• A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
• Recovery of sparsest signals via \(\ell^q \)-minimization
• Learning functions of few arbitrary linear parameters in high dimensions
• On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
• Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications
• Weighted \(\ell_1\)-minimization for sparse recovery under arbitrary prior information
• Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
• An efficient algorithm based on sparse optimization for the aircraft departure scheduling problem
• Robustness of Sparse Recovery via <inline-formula> <tex-math notation="LaTeX">$F$ </tex-math></inline-formula>-Minimization: A Topological Viewpoint
• Improved bounds for restricted isometry constants
• Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
• Spark-level sparsity and the \(\ell_1\) tail minimization
• Theory and applications of compressed sensing
• Letter to the editor: ``On exact recovery of sparse vectors from linear measurements
• Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization
• Necessary and sufficient conditions for linear convergence of \(\ell^1\)-regularization
• Perturbations of measurement matrices and dictionaries in compressed sensing
• Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
• An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices
• A tight bound of modified iterative hard thresholding algorithm for compressed sensing.
• Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions
• Matrix-free interior point method for compressed sensing problems
• A new sufficient condition for sparse vector recovery via \(\ell_1\)-\( \ell_2\) local minimization
• Title not available (Why is that?)
• \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization
• New regularization method and iteratively reweighted algorithm for sparse vector recovery
• New bounds for RIC in compressed sensing
• Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
• Compressed sensing with coherent and redundant dictionaries
• The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
• Restricted isometries for partial random circulant matrices
• Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
• Stable recovery of sparse signals via \(\ell_p\)-minimization
• Sparse recovery using the discrete cosine transform
• On support sizes of restricted isometry constants
• \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
• Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
• Basis adaptive sample efficient polynomial chaos (BASE-PC)
• A survey of compressed sensing
• A survey on compressive sensing: classical results and recent advancements
• k-Sparse Vector Recovery via $$\ell _1-\alpha \ell _2$$ Local Minimization
• The null space property for sparse recovery from multiple measurement vectors
• New bounds on the restricted isometry constant \(\delta _{2k}\)
• Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals
• On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
• A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization
• Sparse signal recovery via non-convex optimization and overcomplete dictionaries
• On the recovery of an integer vector from linear measurements
• A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
• Sparse recovery with coherent frames via \(\ell_{1-2}\)-analysis
• \(k\) block sparse vector recovery via block \(\ell_1-\ell_2\) minimization

This page was built for publication: A note on guaranteed sparse recovery via \(\ell_1\)-minimization

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