Weak greedy algorithms

  title={Weak greedy algorithms},
  author={Vladimir N. Temlyakov},
  journal={Adv. Comput. Math.},
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


Publications citing this paper.
Showing 1-10 of 83 extracted citations

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.


Publications referenced by this paper.
Showing 1-10 of 24 references

On a conjecture of Huber concerning the convergence of projection pursuit regression

  • L. Jones
  • The Annals of Statistics 15
  • 1987
Highly Influential
4 Excerpts

Greedy algorithm and m-term trigonometric approximation

  • V. N. Temlyakov
  • Constructive Approx. 14
  • 1998
1 Excerpt

Nonlinear m-term approximation with regard to the multivariate Haar system

  • V. N. Temlyakov
  • East J. Approx. 4
  • 1998
1 Excerpt

Adaptive greedy approximations

  • G. Davis, S. Mallat, M. Avellaneda
  • Constructive Approximation 13
  • 1997
1 Excerpt

Greedy Algorithms and Applications

  • V. V. Dubinin
  • Ph.D. Thesis, University of South Carolina
  • 1997
3 Excerpts

Similar Papers

Loading similar papers…