Lebesgue inequalities for the greedy algorithm in general bases
From MaRDI portal
Publication:1675683
DOI10.1007/s13163-017-0221-xzbMath1375.41020arXiv1606.06721OpenAlexW2962950807MaRDI QIDQ1675683
Pablo M. Berná, Gustavo Garrigós, Oscar Blasco
Publication date: 2 November 2017
Published in: Revista Matemática Complutense (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.06721
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) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Related Items
Extensions of democracy-like properties for sequences with gaps, Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces, Lebesgue constants for Chebyshev thresholding greedy algorithms, New parameters and Lebesgue-type estimates in greedy approximation, Weak forms of unconditionality of bases in greedy approximation, Greedy algorithm with gaps, Asymptotic greediness of the Haar system in the spaces \(L_p[0,1\), \(1<p<\infty \)], On weighted greedy-type bases, Sparse approximation using new greedy-like bases in superreflexive spaces, Elton's near unconditionality of bases as a threshold-free form of greediness, Greedy-like bases for sequences with gaps, Lorentz spaces and embeddings induced by almost greedy bases in superreflexive Banach spaces, Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases, Lebesgue inequalities for Chebyshev thresholding greedy algorithms, Performance of the thresholding greedy algorithm with larger greedy sums, Quasi-greedy bases for sequences with gaps, 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, The weighted property (A) and the greedy algorithm, Variations of property (A) constants and Lebesgue-type inequalities for the weak thresholding greedy algorithms, On some characterizations of greedy-type bases
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Hardy's inequality and the \(L^ 1\) norm of exponential sums
- Greedy algorithm and \(m\)-term trigonometric approximation
- The thresholding greedy algorithm, greedy bases, and duality
- Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov
- Lebesgue constants for the weak greedy algorithm
- Conditional quasi-greedy bases in Hilbert and Banach spaces
- Greedy Approximation
- Quasi-greedy bases and Lebesgue-type inequalities
- On the existence of almost greedy bases in Banach spaces
- Sharp Jackson and Bernstein inequalities for N-term approximation in sequence spaces with applications
- Biorthogonal systems in Banach spaces
- Greedy algorithm for general biorthogonal systems
- Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems
