Lebesgue-type estimates for greedy algorithms in quasi-Banach spaces
Preprint
Abstract
We continue the study of Lebesgue-type parameters for various greedy algorithms in quasi-Banach spaces. First, we introduce a parameter that can be used with the quasi-greedy parameter to obtain the exact growth of the Lebesgue parameter for strong partially greedy bases. Second, we establish a new upper bound for the Lebesgue parameter for semi-greedy bases using the quasi-greedy and the squeeze symmetry parameters. Finally, we answer several open questions regarding the optimal power in various bounds proved in [F. Albiac, J. L. Ansorena, and P. M. Berná, New parameters and Lebesgue-type estimates in greedy approximation, Forum Math. Sigma 10 (2022), 1-39].Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Weak Greedy Algorithms and the Equivalence Between Semi-greedy and Almost Greedy Markushevich BasesJournal of Fourier Analysis and Applications, 2023
- Strong Partially Greedy Bases and Lebesgue-Type InequalitiesConstructive Approximation, 2021
- Lebesgue inequalities for Chebyshev thresholding greedy algorithmsRevista Matemática Complutense, 2019
- Embeddings and Lebesgue-Type Inequalities for the Greedy Algorithm in Banach SpacesConstructive Approximation, 2018
- Lebesgue inequalities for the greedy algorithm in general basesRevista Matemática Complutense, 2017
- Characterization of 1-almost greedy basesRevista Matemática Complutense, 2016
- Lebesgue constants for the weak greedy algorithmRevista Matemática Complutense, 2014
- Lebesgue-Type Inequalities for Quasi-greedy BasesConstructive Approximation, 2013
- The Thresholding Greedy Algorithm, Greedy Bases, and DualityConstructive Approximation, 2003
- Greedy Algorithm for General Biorthogonal SystemsJournal of Approximation Theory, 2000