Abstract
The convergence rate of a weak orthogonal greedy algorithm is studied for the subspace ℓ1 ⊂ ℓ2 and orthogonal dictionaries. It is shown that general results on convergence rate of weak orthogonal greedy algorithms can be essentially improved in the studied case. It is also shown that this improvement is asymptotically sharp.
References
A. N. Kolmogorov and S. V. Fomin, Elements of the Theory of Functions and Functional Analysis (Nauka, Moscow, 1976; Dover Publ., 1999).
S. B. Stechkin, “Absolute Convergence of Orthogonal Series,” Doklady Akad, Nauk SSSR 102 (1), 37 (1955).
R. A. DeVore and V. N. Temlyakov, “Some Remarks on Greedy Algorithms,” Adv. Comput. Math. 5 (1), 173 (1996).
V. N. Temlyakov, “Weak Greedy Algorithms,” Adv. Comput. Math. 12 (2–3), 213 (2000).
A. V. Sil’nichenko, “Rate of Convergence of Greedy Algorithms,” Matem. Zametki 76 (4), 628 (2004).
E. D. Livshits, “Lower Estimates for the Rate of Convergence of Greedy Algorithms,” Izvestiya Rus. Akad. Nauk, Matem. 73 (6), 125 (2009).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.S. Orlova, 2017, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2017, Vol. 72, No. 2, pp. 68–72.
About this article
Cite this article
Orlova, A.S. The rate of convergence of weak greedy approximations over orthogonal dictionaries. Moscow Univ. Math. Bull. 72, 84–87 (2017). https://doi.org/10.3103/S0027132217020097
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0027132217020097