A counter-example to the general convergence of partially greedy algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Approximation Theory Year : 2001

A counter-example to the general convergence of partially greedy algorithms

Rémi Gribonval

Abstract

In a separable Hilbert space $\mathcalH$, greedy algorithms iteratively define $m$-term approximants to a given vector from a complete redundant dictionary $\Dict$. With very large dictionaries, the pure greedy algorithm cannot be implemented and must be replaced with a weak greedy algorithm. In numerical applications, \em partially greedy algorithms have been introduced to reduce the numerical complexity. A conjecture about their convergence arises naturally from the observation of numerical experiments. We introduce, study and disprove this conjecture.
Fichier principal
Vignette du fichier
vwga.pdf (197.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00576644 , version 1 (15-03-2011)

Identifiers

Cite

Rémi Gribonval. A counter-example to the general convergence of partially greedy algorithms. Journal of Approximation Theory, 2001, 111 (1), pp.128-138. ⟨10.1006/jath.2001.3556⟩. ⟨inria-00576644⟩
40 View
108 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More