Algorithms for simultaneous sparse approximation. Part II: Convex relaxation
University of Michigan–Ann Arbor
Indexed incrossref
Abstract
No abstract available for this paper.
Citation impact
713
total citations
- FWCI
- 19.12
- Percentile
- 100%
- References
- 26
Citations per year
Authors
1Topics & keywords
Topics
Keywords
- Matching pursuit
- Relaxation (psychology)
- Sparse approximation
- Convex optimization
- Approximation algorithm
- Greedy algorithm
- Linear programming relaxation
- Regular polygon
No related works found for this paper.