Recovery of Short, Complex Linear Combinations Via<tex>ell _1</tex>Minimization
DOI10.1109/TIT.2005.844057zbMATH Open1288.94020DBLPjournals/tit/Tropp05WikidataQ59750814 ScholiaQ59750814MaRDI QIDQ3547717FDOQ3547717
Authors: Joel A. Tropp 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
- On exact recovery of sparse vectors from linear measurements
- Sparse Recovery Conditions and Performance Bounds for $\ell _p$-Minimization
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Near-optimal matrix recovery from random linear measurements
- Methods for sparse and low-rank recovery under simplex constraints
- On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$
Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Cited In (18)
- Feature selection when there are many influential features
- Remote sensing via \(\ell_1\)-minimization
- Minimizers of sparsity regularized Huber loss function
- Computing and analyzing recoverable supports for sparse reconstruction
- Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications
- Sparse recovery by non-convex optimization - instance optimality
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games
- Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines
- Cosparsity in Compressed Sensing
- Submatrices with nonuniformly selected random supports and insights into sparse approximation
- On the conditioning of random subdictionaries
- Sampling rates for \(\ell^1\)-synthesis
- The null space property for sparse recovery from multiple measurement vectors
- A hierarchical framework for recovery in compressive sensing
- Strengthening hash families and compressive sensing
- Sparse signal recovery using a new class of random matrices
- Sparsity in time-frequency representations
This page was built for publication: Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547717)
