Rate of convergence of thresholding greedy algorithms
This paper is a follow-up to the paper [\textit{V. N. Temlyakov}, ``On the rate of convergence of greedy algorithms, Preprint, \url{arXiv:2304.06423}]. In that paper the author found the rate of convergence of some standard greedy algorithms with respect to arbitrary dictionaries. There he bounded the error of approximation by the product of both the norm of \(f\) and the \(A_1\)-norm of \(f\). This is an important feature of [loc. cit.], since typically only the \(A_1\)-norm of \(f\) is used. This paper is focused on a special class of dictionaries, namely, on various types of bases -- greedy bases, unconditional bases, and quasi-greedy bases. The author studies the rate of convergence of the classical Thresholding Greedy Algorithm with respect to bases in the style of [loc. cit.]. In particular, he proves that the given bounds for the trigonometric basis and Haar basis are optimal.
- On the rate of convergence of greedy algorithms.
- The rate of convergence of weak greedy approximations over orthogonal dictionaries
- On the rate of convergence of a pure greedy algorithm.
- Convergence of some greedy algorithms in Banach spaces
- Lower bounds for the rate of convergence of greedy algorithms
- A discrete transform and decompositions of distribution spaces
- A remark on greedy approximation in Banach spaces.
- Greedy algorithm and \(m\)-term trigonometric approximation
- Greedy algorithm for general biorthogonal systems
- Greedy algorithms with regard to multivariate systems with special structure
- Greedy approximation with regard to non-greedy bases
- scientific article; zbMATH DE number 43504 (Why is no real title available?)
- scientific article; zbMATH DE number 43689 (Why is no real title available?)
- Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
- Hyperbolic wavelet approximation
- Multivariate approximation
- Rates of convex approximation in non-Hilbert spaces
- Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov
- The best m-term approximation and greedy algorithms
- Universal bases and greedy algorithms for anisotropic function classes
This page was built for publication: Rate of convergence of thresholding greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569587)
