Highly Influenced

# Weak greedy algorithms

@article{Temlyakov2000WeakGA, title={Weak greedy algorithms}, author={Vladimir N. Temlyakov}, journal={Adv. Comput. Math.}, year={2000}, volume={12}, pages={213-227} }

- Published 2000 in Adv. Comput. Math.
DOI:10.1023/A:1018917218956

Theoretical greedy type algorithms are studied: a Weak Greedy Algorithm, a Weak Orthogonal Greedy Algorithm, and a Weak Relaxed Greedy Algorithm. These algorithms are defined by weaker assumptions than their analogs the Pure Greedy Algorithm, an Orthogonal Greedy Algorithm, and a Relaxed Greedy Algorithm. The weaker assumptions make these new algorithms more ready for practical implementation. We prove the convergence theorems and also give estimates for the rate of approximation by means ofâ€¦Â CONTINUE READING

Highly Cited

This paper has 142 citations. REVIEW CITATIONS

#### From This Paper

##### Topics from this paper.

83 Citations

24 References

Similar Papers

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 142 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**142**citations based on the available data.See our **FAQ** for additional information.