The weighted property (A) and the greedy algorithm
From MaRDI portal
Publication:2334382
DOI10.1016/j.jat.2019.105300zbMath1440.46011arXiv1803.05052OpenAlexW2975512327WikidataQ127219947 ScholiaQ127219947MaRDI QIDQ2334382
Denka Kutzarova, Ben Wallis, Stephen Dilworth, Pablo M. Berná, Timur Oikhberg
Publication date: 7 November 2019
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.05052
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 (10)
Extensions of democracy-like properties for sequences with gaps ⋮ Weak forms of unconditionality of bases in greedy approximation ⋮ On weighted greedy-type bases ⋮ Greedy-like bases for sequences with gaps ⋮ Performance of the thresholding greedy algorithm with larger greedy sums ⋮ Weight-partially greedy bases and weight-property \((A)\) ⋮ Characterization of weight-semi-greedy bases ⋮ Equivalence between almost-greedy and semi-greedy bases ⋮ Strong partially greedy bases and Lebesgue-type inequalities ⋮ Greedy approximation for biorthogonal systems in quasi-Banach spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Renorming spaces with greedy bases
- Characterization of greedy bases in Banach spaces
- Characterization of 1-almost greedy bases
- The best \(m\)-term approximation with respect to polynomials with constant coefficients
- Characterization of 1-greedy bases
- The thresholding greedy algorithm, greedy bases, and duality
- Lebesgue inequalities for the greedy algorithm in general bases
- Convergence of some greedy algorithms in Banach spaces
- Restricted nonlinear approximation
- Lebesgue constants for the weak greedy algorithm
- Weight-almost greedy bases
- Greedy Approximation
- On the existence of almost greedy bases in Banach spaces
- Greedy algorithm for general biorthogonal systems
This page was built for publication: The weighted property (A) and the greedy algorithm