Brief introduction in greedy approximation
Russian Mathematical Surveys · 2025 · 80 (5) · 763-841
DOI: 10.4213/rm10245e ↗Kurz gefasst
Fachartikel in der Zeitschrift Russian Mathematical Surveys, online erschienen am 12.01.2026. Verfasst von Vladimir Nikolaevich Temlyakov. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 102 Literaturangaben. Gefördert von: Russian Science Foundation.
Abstract (Originalsprache)
Sparse approximation is important in many applications because of the concise form of an approximant and good accuracy guarantees. The theory of compressed sensing, which proved to be very useful in the image processing and data sciences, is based on the concept of sparsity. A fundamental issue of sparse approximation is the problem of the construction of efficient algorithms which provide good approximation. It turns out that greedy algorithms with respect to dictionaries are very good from this point of view. They are simple in implementation, and there are well-developed theoretical guarantees of their efficiency. This survey/tutorial paper contains a brief description of different kinds of greedy algorithms and results on their convergence and rate of convergence. Also, in §§ 14 and 15 we give some typical proofs of convergence and rate of convergence results for important greedy algorithms and in Section § 16 we list some open problems. Bibliography: 91 titles.
Förderung
- Russian Science Foundation
Zitieren
APA
Temlyakov, V. N. (2025). Brief introduction in greedy approximation. Russian Mathematical Surveys, 80(5), 763-841. https://doi.org/10.4213/rm10245e
Vancouver
Temlyakov VN. Brief introduction in greedy approximation. Russian Mathematical Surveys. 2025;80(5):763-841. doi:10.4213/rm10245e
BibTeX
@article{Temlyakov2025,
author = {Temlyakov, Vladimir Nikolaevich},
title = {Brief introduction in greedy approximation},
journal = {Russian Mathematical Surveys},
year = {2025},
volume = {80},
number = {5},
pages = {763--841},
doi = {10.4213/rm10245e}
}
EUVIMED