Characterization of 1-quasi-greedy bases

DOI10.1016/J.JAT.2015.08.006MaRDI QIDQ892173zbMATH OpenOpenAlexFDO

Authors F. Albiac, J. L. Ansorena

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

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)

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.

Recommendations

• Characterization of greedy bases in Banach spaces
• Characterization of 1-greedy bases
• Characterization of 1-almost greedy bases
• Building highly conditional almost greedy and quasi-greedy bases in Banach spaces
• Conditional quasi-greedy bases in Hilbert and Banach spaces

Cites work

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

Cited in

(19)

• Counterexamples in isometric theory of symmetric and greedy bases
• A note on 1-semi-greedy bases in \(p\)-Banach spaces with \(0 < P \leq 1\)
• Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
• Greedy algorithm with gaps
• Lebesgue constants for Chebyshev thresholding greedy algorithms
• On the quasi-greedy basic sequence problem
• Characterizations of almost greedy and partially greedy bases
• Banach spaces with a unique greedy basis
• Greedy approximation for biorthogonal systems in quasi-Banach spaces
• Almost isometric constants for partial unconditionality
• Elton's near unconditionality of bases as a threshold-free form of greediness
• Conditionality constants of quasi-greedy bases in super-reflexive Banach spaces
• On consecutive greedy and other greedy-like type of bases
• Quasi-greedy bases for sequences with gaps
• 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
• A note on partially-greedy bases in quasi-Banach spaces

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)