Variations of property (A) constants and Lebesgue-type inequalities for the weak thresholding greedy algorithms
From MaRDI portal
Publication:2104952
DOI10.1016/j.jat.2022.105831OpenAlexW4306404850MaRDI QIDQ2104952
Publication date: 8 December 2022
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.06838
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) Harmonic analysis on Euclidean spaces (42-XX) Approximations and expansions (41-XX)
Cites Work
- Unnamed Item
- Unnamed Item
- Lebesgue-type inequalities for quasi-greedy bases
- Renorming spaces with greedy bases
- Characterization of 1-almost greedy bases
- Characterization of 1-greedy bases
- The best \(m\)-term approximation and greedy algorithms
- The thresholding greedy algorithm, greedy bases, and duality
- Lebesgue inequalities for the greedy algorithm in general bases
- Strong partially greedy bases and Lebesgue-type inequalities
- On some characterizations of greedy-type bases
- Lebesgue inequalities for Chebyshev thresholding greedy algorithms
- Weight-partially greedy bases and weight-property \((A)\)
- Lebesgue constants for the weak greedy algorithm
- Topics in Banach Space Theory
- Quasi-greedy bases and Lebesgue-type inequalities
- A note on partially-greedy bases in quasi-Banach spaces
- On the existence of almost greedy bases in Banach spaces
- Greedy algorithm for general biorthogonal systems
This page was built for publication: Variations of property (A) constants and Lebesgue-type inequalities for the weak thresholding greedy algorithms
