Phase transitions for greedy sparse approximation algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, solutions of underdetermined linear systems of equations. Many such algorithms have now been proven to have optimal-order...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Published: |
Elsevier
2010
|