Algorithms for simultaneous sparse approximation. Part II: Convex relaxation
Joel A. Tropp · Signal Processing · 2005
Cited by 691 works. doi:10.1016/j.sigpro.2005.05.031
Authors
References
- Convex Optimization
- Atomic Decomposition by Basis Pursuit
- Greed is Good: Algorithmic Results for Sparse Approximation
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable recovery of sparse overcomplete representations in the presence of noise
- Interpolation Spaces: An Introduction
- Just relax: convex programming methods for identifying sparse signals in noise
- Sparse Approximate Solutions to Linear Systems
- On Sparse Representations in Arbitrary Redundant Bases
- Proceedings IEEE International Conference on Acoustics Speech and Signal Processing