arXiv · 1811.04268
Lebesgue inequalities for Chebyshev Thresholding Greedy Algorithms
Abstract
We establish estimates for the Lebesgue parameters of the Chebyshev Weak Thresholding Greedy Algorithm in the case of general bases in Banach spaces. These generalize and slightly improve earlier results in [9], and are complemented with examples showing the optimality of the bounds. Our results also correct certain bounds recently announced in [18], and answer some questions left open in that paper.
Explore related subjects
Keep this discovery
Pablo M. Berná, Oscar Blasco, Gustavo Garrigós, Eugenio Hernández, Timur Oikhberg. 2018-11-10. Lebesgue inequalities for Chebyshev Thresholding Greedy Algorithms. https://arxiv.org/abs/1811.04268
Cite the original work for its findings. Save a collection to share your selection of sources.