Temlyakov, V. N. Weak greedy algorithms. (English) Zbl 0964.65009 Adv. Comput. Math. 12, No. 2-3, 213-227 (2000). Theoretical aspects of the efficiency of \(M\)-term approximation is studied for “weak” greedy algorithms. These are defined by weaker assumptions than their known analogs: the pure greedy algorithm, an orthogonal greedy algorithm, and a relaxed greedy algorithm. Convergence theorems and rates of approximation by these algorithms are proved. The results apply to approximation from an arbitrary dictionary in a Hilbert space. Reviewer: S.Zlobec (Montreal) Cited in 5 ReviewsCited in 71 Documents MSC: 65D15 Algorithms for approximation of functions 41A65 Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) Keywords:best approximation; convergence; greedy algorithms; Hilbert space PDFBibTeX XMLCite \textit{V. N. Temlyakov}, Adv. Comput. Math. 12, No. 2--3, 213--227 (2000; Zbl 0964.65009) Full Text: DOI