Characterization of 1-quasi-greedy bases
From MaRDI portal
Publication:892173
DOI10.1016/j.jat.2015.08.006zbMath1335.46010arXiv1504.04368OpenAlexW1485896679MaRDI QIDQ892173
José Luis Ansorena, Fernando Albiac
Publication date: 18 November 2015
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.04368
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)
Related Items
Lebesgue constants for Chebyshev thresholding greedy algorithms, Greedy algorithm with gaps, Elton's near unconditionality of bases as a threshold-free form of greediness, Counterexamples in isometric theory of symmetric and greedy bases, Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases, Performance of the thresholding greedy algorithm with larger greedy sums, Characterization of greedy bases in Banach spaces, Characterization of 1-almost greedy bases, Conditional quasi-greedy bases in non-superreflexive Banach spaces, Quasi-greedy bases for sequences with gaps, Almost isometric constants for partial unconditionality, Greedy approximation for biorthogonal systems in quasi-Banach spaces
Cites Work
- Unnamed Item
- Lebesgue-type inequalities for quasi-greedy bases
- Renorming spaces with greedy bases
- Characterization of 1-greedy bases
- The thresholding greedy algorithm, greedy bases, and duality
- On approximate \(\ell_1\) systems in Banach spaces
- Conditional quasi-greedy bases in Hilbert and Banach spaces
- A conditional quasi-greedy basis of l1
- On the existence of almost greedy bases in Banach spaces
- Greedy algorithm for general biorthogonal systems