Skip to Main content Skip to Navigation
Journal articles

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 [35 references]  Display  Hide  Download
Contributor : Sandrine Anthoine <>
Submitted on : Wednesday, November 7, 2018 - 5:06:47 PM
Last modification on : Thursday, January 23, 2020 - 6:22:13 PM
Document(s) archivé(s) le : Friday, February 8, 2019 - 3:04:31 PM


Files produced by the author(s)



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⟩



Record views


Files downloads