Journal article
Phase transitions for greedy sparse approximation algorithms
- Abstract:
-
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 uniform recovery guarantees using the ubiquitous Restricted Isometry Property (RIP) (Candès and Tao (2005) [11). However, without specifying a matrix, or class of matrices, it is unclear when the R...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Bibliographic Details
- Publisher:
- Elsevier Publisher's website
- Journal:
- Applied and Computational Harmonic Analysis Journal website
- Volume:
- 2
- Issue:
- 30
- Pages:
- 188-203
- Publication date:
- 2010-01-01
- DOI:
- EISSN:
-
1096-603X
- ISSN:
-
1063-5203
- Source identifiers:
-
357778
Item Description
- Keywords:
- Pubs id:
-
pubs:357778
- UUID:
-
uuid:0c4e9d51-7cae-4ec6-b62a-84be773e16f5
- Local pid:
- pubs:357778
- Deposit date:
- 2013-11-16
Terms of use
- Copyright holder:
- Elsevier Inc
- Copyright date:
- 2010
- Notes:
- Copyright © 2010 Elsevier Inc. All rights reserved. NOTICE: this is the author’s version of a work that was accepted for publication in Applied and Computational Harmonic Analysis. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Applied and Computational Harmonic Analysis, 30, 2, March 2011 http://dx.doi.org/10.1016/j.acha.2010.07.001
If you are the owner of this record, you can report an update to it here: Report update to this record