Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
-
Published:2012-09
Issue:3-4
Volume:92
Page:485-489
-
ISSN:0001-4346
-
Container-title:Mathematical Notes
-
language:en
-
Short-container-title:Math Notes
Author:
Dereventsov A. V.
Publisher
Pleiades Publishing Ltd
Subject
General Mathematics
Reference16 articles.
1. J.H. Friedman and W. Stueuzle, “Projection pursuit regression,” J. Amer. Statist. Assoc. 76(376), 817–823 (1981).
2. L. K. Jones, “On a conjecture of Huber concerning the convergence of projection pursuit regression,” Ann. Statist. 15(2), 880–882 (1987).
3. S. G. Mallat and Z. Zhang, “Matching pursuit with time-frequency dictionaries,” IEEE Trans. Signal Process. 41(12), 3397–3415 (1993).
4. R. A. DeVore and V. N. Temlyakov, “Some remarks on greedy algorithms,” Adv. Comput. Math. 5(2–3), 173–187 (1996).
5. V. N. Temlyakov, “Weak greedy algorithms,” Adv. Comput. Math. 12(2–3), 213–227 (2000).