Rate of convergence of thresholding greedy algorithms
From MaRDI portal
Publication:6569587
Recommendations
- 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
Cites work
- scientific article; zbMATH DE number 43504 (Why is no real title available?)
- scientific article; zbMATH DE number 43689 (Why is no real title available?)
- 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
- 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)
