Characterization of 1-quasi-greedy bases

DOI10.1016/J.JAT.2015.08.006zbMATH Open1335.46010arXiv1504.04368OpenAlexW1485896679MaRDI QIDQ892173FDOQ892173

J. L. Ansorena, F. Albiac

Publication date: 18 November 2015

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Abstract: We show that a (semi-normalized) basis in a Banach space is quasi-greedy with quasi-greedy constant equal to 1 if and only if it is unconditional with suppression-unconditional constant equal to 1.

Full work available at URL: https://arxiv.org/abs/1504.04368

zbMATH Keywords

renormingunconditional basisquasi-greedy basisthresholding greedy algorithm

Mathematics Subject Classification ID

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)

Cites Work

• The thresholding greedy algorithm, greedy bases, and duality
• A remark on greedy approximation in Banach spaces.
• Greedy algorithm for general biorthogonal systems
• Conditional quasi-greedy bases in Hilbert and Banach spaces
• Lebesgue-type inequalities for quasi-greedy bases
• On the existence of almost greedy bases in Banach spaces
• A conditional quasi-greedy basis of l₁
• On approximate \(\ell_1\) systems in Banach spaces
• Renorming spaces with greedy bases
• Characterization of 1-greedy bases

Cited In (15)

• Lebesgue constants for Chebyshev thresholding greedy algorithms
• Greedy approximation for biorthogonal systems in quasi-Banach spaces
• Counterexamples in isometric theory of symmetric and greedy bases
• Quasi-greedy bases for sequences with gaps
• Conditional quasi-greedy bases in non-superreflexive Banach spaces
• Banach spaces with a unique greedy basis
• Almost isometric constants for partial unconditionality
• On consecutive greedy and other greedy-like type of bases
• Performance of the thresholding greedy algorithm with larger greedy sums
• On the quasi-greedy basic sequence problem
• Greedy algorithm with gaps
• Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
• Elton's near unconditionality of bases as a threshold-free form of greediness
• Characterization of greedy bases in Banach spaces
• Characterization of 1-almost greedy bases

This page was built for publication: Characterization of 1-quasi-greedy bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892173)