EUVIMEDOpdag EUVIMED
Crossref

Brief introduction in greedy approximation

Vladimir Nikolaevich Temlyakov

Успехи математических наук · 2025 · 80 (5(485)) · 23-104

DOI: 10.4213/rm10245 ↗

At a glance

Journal article in Успехи математических наук, published online on 2025-10-01. Written by Vladimir Nikolaevich Temlyakov. Cited 3 times so far (Crossref); 126 references. Funded by: Russian Science Foundation.

AbstractBibliografiske oplysningerCiteRelated studies

Abstract (original language)

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.

Funding

  • Russian Science Foundation

Cite

APA

Temlyakov, V. N. (2025). Brief introduction in greedy approximation. Успехи математических наук, 80(5(485)), 23-104. https://doi.org/10.4213/rm10245

Vancouver

Temlyakov VN. Brief introduction in greedy approximation. Успехи математических наук. 2025;80(5(485)):23-104. doi:10.4213/rm10245

BibTeX
@article{Temlyakov2025,
  author = {Temlyakov, Vladimir Nikolaevich},
  title = {Brief introduction in greedy approximation},
  journal = {Успехи математических наук},
  year = {2025},
  volume = {80},
  number = {5(485)},
  pages = {23--104},
  doi = {10.4213/rm10245}
}
Start for free →