Generalized Greedy Alternatives

Abstract : In this paper, we develop greedy algorithms to tackle the problem of finding sparse approximations of zeros of operators in a Hilbert space of possibly infinite dimension. Four greedy algorithms, Subspace Pursuit, CoSaMP, HTP and IHT, which are classically used for sparse approximation, are extended. A criterion, the Restricted Diagonal Property, is developed. It guarantees the definition of the extended algorithms and is used to derive error bounds. We also provide examples and experiments that illustrate these theoretical results.
Document type :
Journal articles
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01431322
Contributor : Sandrine Anthoine <>
Submitted on : Wednesday, November 7, 2018 - 5:06:47 PM
Last modification on : Monday, March 4, 2019 - 2:04:22 PM
Long-term archiving on : Friday, February 8, 2019 - 3:04:31 PM

File

GenGreed_ACHA.pdf
Files produced by the author(s)

Identifiers

Citation

François-Xavier Dupé, Sandrine Anthoine. Generalized Greedy Alternatives. Applied and Computational Harmonic Analysis, Elsevier, 2018, ⟨10.1016/j.acha.2018.10.005⟩. ⟨hal-01431322v2⟩

Share

Metrics

Record views

94

Files downloads

172