Equivalence between almost-greedy and semi-greedy bases

DOI10.1016/j.jmaa.2018.09.065zbMath1457.46015arXiv1804.05730OpenAlexW2963966435WikidataQ129164004 ScholiaQ129164004MaRDI QIDQ1799771

Pablo M. Berná

Publication date: 19 October 2018

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

thresholding greedy algorithmalmost-greedy basessemi-greedy bases

Mathematics Subject Classification ID

Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)

Related Items (6)

Greedy-like bases for sequences with gaps ⋮ Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases ⋮ Extensions and new characterizations of some greedy-type bases ⋮ Lebesgue inequalities for Chebyshev thresholding greedy algorithms ⋮ Characterization of weight-semi-greedy bases ⋮ On some characterizations of greedy-type bases

Cites Work

• Unnamed Item
• Lebesgue-type inequalities for quasi-greedy bases
• The thresholding greedy algorithm, greedy bases, and duality
• Lebesgue inequalities for the greedy algorithm in general bases
• The weighted property (A) and the greedy algorithm
• Lebesgue constants for the weak greedy algorithm
• On the existence of almost greedy bases in Banach spaces
• Greedy algorithm for general biorthogonal systems

This page was built for publication: Equivalence between almost-greedy and semi-greedy bases