A criterion for convergence of weak greedy algorithms (Q1610211)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A criterion for convergence of weak greedy algorithms |
scientific article; zbMATH DE number 1783433
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A criterion for convergence of weak greedy algorithms |
scientific article; zbMATH DE number 1783433 |
Statements
A criterion for convergence of weak greedy algorithms (English)
0 references
19 August 2002
0 references
This paper completes the investigation of necessary and sufficient conditions on the weakness sequence \(\tau = \{t_k\}_{k=1}^{\infty}\), \(0\leq t_k\leq 1\) for convergence of weak greedy algorithm for all dictionaries \(\mathcal D\) and each function \(f\) in the Hilbert space \(H\).
0 references
weak Greedy Algorithms
0 references
Hilbert space
0 references
dictionary, convergence
0 references
0.9705852
0 references
0.9455602
0 references
0.9228142
0 references
0 references
0.9064244
0 references
0 references
0.9034697
0 references
0.90335494
0 references
0.90258616
0 references
