A note on guaranteed sparse recovery via \(\ell_1\)-minimization
From MaRDI portal
Publication:984666
DOI10.1016/j.acha.2009.10.004zbMath1198.41011OpenAlexW2076684473MaRDI QIDQ984666
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
Related Items
A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery, Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization, A survey on compressive sensing: classical results and recent advancements, A Survey of Compressed Sensing, Sparse signal recovery via non-convex optimization and overcomplete dictionaries, Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations, A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization, The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing, Restricted isometries for partial random circulant matrices, Recovery of sparsest signals via \(\ell^q \)-minimization, Unnamed Item, Basis adaptive sample efficient polynomial chaos (BASE-PC), Sparse Legendre expansions via \(\ell_1\)-minimization, A tight bound of modified iterative hard thresholding algorithm for compressed sensing., \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization, Weighted ${\ell}_{{1}}$-minimization for sparse recovery under arbitrary prior information, Learning functions of few arbitrary linear parameters in high dimensions, Compressive Sensing, Perturbations of measurement matrices and dictionaries in compressed sensing, New bounds on the restricted isometry constant \(\delta _{2k}\), New bounds for RIC in compressed sensing, Stable recovery of sparse signals via \(\ell_p\)-minimization, Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions, Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications, Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO, The null space property for sparse recovery from multiple measurement vectors, Compressed sensing with coherent and redundant dictionaries, An efficient algorithm based on sparse optimization for the aircraft departure scheduling problem, On support sizes of restricted isometry constants, Improved bounds for restricted isometry constants, New regularization method and iteratively reweighted algorithm for sparse vector recovery, Necessary and sufficient conditions for linear convergence of ℓ1-regularization, Matrix-free interior point method for compressed sensing problems, Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model, Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization, Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit, Theory and applications of compressed sensing, A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization, On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
Cites Work
- The restricted isometry property and its implications for compressed sensing
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Decoding by Linear Programming
- Sparse representations in unions of bases
- Shifting Inequality and Recovery of Sparse Signals
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
