Journal article icon

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
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1016/j.acha.2010.07.001

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Mathematical Inst
Role:
Author
More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Mathematical Inst
Role:
Author
More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Mathematical Inst
Role:
Author
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
URN:
uuid:0c4e9d51-7cae-4ec6-b62a-84be773e16f5
Source identifiers:
357778
Local pid:
pubs:357778

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP