Embeddings and Lebesgue-Type Inequalities for the Greedy Algorithm in Banach Spaces
- 22 January 2018
- journal article
- research article
- Published by Springer Nature in Constructive Approximation
- Vol. 48 (3) , 415-451
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Lebesgue inequalities for the greedy algorithm in general basesRevista Matemática Complutense, 2017
- Lorentz Spaces and Embeddings Induced by Almost Greedy Bases in Banach SpacesConstructive Approximation, 2015
- Lebesgue constants for the weak greedy algorithmRevista Matemática Complutense, 2014
- Lebesgue-Type Inequalities for Quasi-greedy BasesConstructive Approximation, 2013
- Quasi-greedy bases and Lebesgue-type inequalitiesStudia Mathematica, 2012
- Recent developments in the theory of Lorentz spaces and weighted inequalitiesMemoirs of the American Mathematical Society, 2007
- The Thresholding Greedy Algorithm, Greedy Bases, and DualityConstructive Approximation, 2003
- On the existence of almost greedy bases in Banach spacesStudia Mathematica, 2003
- A conditional quasi-greedy basis of l1Studia Mathematica, 2001
- Functional Analysis and Infinite-Dimensional Geometry2001