1. V. V. Galatenko and E. D. Livshits, “Generalized approximate weak greedy algorithms,” Mat. Zametki 78(2), 186–201 (2005) [Math. Notes 78 (1–2), 170–184 (2005)].
2. L. Jones, “A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and network training,” Ann. Statist. 20(1), 608–613 (1992).
3. V. N. Temlyakov, “Weak greedy algorithms,” Adv. Comput. Math. 12(2–3), 213–227 (2000).
4. E. D. Livshits and V. N. Temlyakov, “On convergence of weak greedy algorithms,” in Trudy Mat. Inst. Steklov, Vol. 232: Function Spaces, Harmonic Analysis, Differential Equations (Nauka, Moscow, 2001), pp. 236–247 [Proc. Steklov Inst. Math., Vol. 232, pp. 229–239, 2001].
5. V. N. Temlyakov, “A criterion for convergence of Weak Greedy Algorithms,” Adv. Comp. Math. 17(3), 269–280 (2002).