Summability Methods for the Greedy Algorithm in Banach spaces
Abstract
For the past 25 years, one of the most studied algorithms in the field of Nonlinear Approximation Theory has been the Thresholding Greedy Algorithm. In this paper, we propose new summability methods for this algorithm, generating two new types of greedy-like bases - namely Ces\`aro quasi-greedy and de la Vall\'ee-Poussin-quasi-greedy bases. We analyze the connection between these types of bases and the well-known quasi-greedy bases, and leave some open problems for future research. In addition, as a consequence of our techniques for handling these summability methods, we answer a question posed by P. Wojtaszczyk in [16], by giving a categorial proof of equivalence between the uniform boundedness of the greedy sums and the convergence of the thresholding greedy algorithm.
Keywords
Cite
@article{arxiv.2504.13350,
title = {Summability Methods for the Greedy Algorithm in Banach spaces},
author = {Miguel Berasategui and Pablo M. Berná and Stephen J. Dilworth and Denka Kutzarova},
journal= {arXiv preprint arXiv:2504.13350},
year = {2025}
}