Abstract
A weak conical greedy algorithm is introduced with respect to an arbitrary positive complete dictionary in a Hilbert space; this algorithm gives an approximation of an arbitrary space element by a combination of dictionary elements with nonnegative coefficients. The convergence of this algorithm is proved and an estimate of the convergence rate for the elements of the convex hull of the dictionary is given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. J. Moreau, “Décomposition orthogonale d’un espace hilbertien selon deux cónes mutuellement polaires,” C. R. Acad. Sci. Paris 255, 238–240 (1962).
V. N. Temlyakov, Greedy Approximation (Cambridge Univ. Press, Cambridge, 2011).
E. D. Livshits, “On the recursive greedy algorithm,” Izv. Math. 70 (1), 87–108 (2006).
E. D. Livshits, “On \(n\)-term approximation with positive coefficients,” Math. Notes 82 (3), 332–340 (2007).
P. A. Borodin, “Example of divergence of a greedy algorithm with respect to an asymmetric dictionary,” Math. Notes 109 (3), 379–385 (2021).
V. N. Temlyakov, “Weak greedy algorithms,” Adv. Comput. Math. 12, 213–227 (2000).
Acknowledgments
The author wishes to extend gratitude to P. A. Borodin for posing the problem and valuable comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Matematicheskie Zametki, 2022, Vol. 112, pp. 163–169 https://doi.org/10.4213/mzm13424.
Rights and permissions
About this article
Cite this article
Valov, M.A. Conical Greedy Algorithm. Math Notes 112, 171–176 (2022). https://doi.org/10.1134/S0001434622070203
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434622070203