Weak Greedy Algorithms and the Equivalence Between Semi-greedy and Almost Greedy Markushevich Bases
- 1 March 2023
- journal article
- research article
- Published by Springer Nature in Journal of Fourier Analysis and Applications
- Vol. 29 (2) , 1-37
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Lebesgue inequalities for the greedy algorithm in general basesRevista Matemática Complutense, 2017
- Characterization of 1-almost greedy basesRevista Matemática Complutense, 2016
- Topics in Banach Space Theory2016
- Characterization of -quasi-greedy basesJournal of Approximation Theory, 2016
- Lebesgue constants for the weak greedy algorithmRevista Matemática Complutense, 2014
- Weak thresholding greedy algorithms in Banach spacesJournal of Functional Analysis, 2012
- On convergence of Weak Thresholding Greedy Algorithm inJournal of Approximation Theory, 2009
- The Thresholding Greedy Algorithm, Greedy Bases, and DualityConstructive Approximation, 2003
- On the existence of almost greedy bases in Banach spacesStudia Mathematica, 2003
- Greedy Algorithm for General Biorthogonal SystemsJournal of Approximation Theory, 2000