Lebesgue inequalities for Chebyshev Thresholding Greedy Algorithms

2018/11/10 by Berná, Pablo M., Blasco, Oscar, Garrigós, Gustavo +2 · 1 citation
#FOS: Mathematics #Functional Analysis (math.FA)

paper · doi:10.48550/arxiv.1811.04268

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.

Cited by

• Lebesgue-type estimates for greedy algorithms in quasi-Banach spaces

Related

• Lebesgue inequalities for the greedy algorithm in general bases
• Lebesgue-type inequalities in greedy approximation
• The Weak Chebyshev Greedy Algorithm (WCGA) in L^p (log L)^α spaces
• Lebesgue type inequalities for quasi-greedy bases
• Lebesgue-Type inequalities for quasi-greedy bases