Lebesgue inequalities for Chebyshev thresholding greedy algorithms

DOI10.1007/s13163-019-00328-9zbMath1451.41010arXiv1811.04268OpenAlexW2975218920WikidataQ127218617 ScholiaQ127218617MaRDI QIDQ2206762

Eugenio Hernández, Oscar Blasco, Gustavo Garrigós, Pablo M. Berná, Timur Oikhberg

Publication date: 26 October 2020

Published in: Revista Matemática Complutense (Search for Journal in Brave)

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

zbMATH Keywords

Chebyshev thresholding greedy algorithmChebyshevian Lebesgue parameter

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Related Items (4)

Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases ⋮ Strong partially greedy bases and Lebesgue-type inequalities ⋮ Greedy approximation for biorthogonal systems in quasi-Banach spaces ⋮ Variations of property (A) constants and Lebesgue-type inequalities for the weak thresholding greedy algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lebesgue-type inequalities for quasi-greedy bases
• Characterization of greedy bases in Banach spaces
• Characterization of 1-almost greedy bases
• Lebesgue constants for Chebyshev thresholding greedy algorithms
• How good can a nonhereditary family be?
• The best \(m\)-term approximation and greedy algorithms
• Greedy algorithm and \(m\)-term trigonometric approximation
• The thresholding greedy algorithm, greedy bases, and duality
• Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces
• Lebesgue inequalities for the greedy algorithm in general bases
• Conditional quasi-greedy bases in non-superreflexive Banach spaces
• Equivalence between almost-greedy and semi-greedy bases
• 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
• On the Fejér means of bounded Ciesielski systems
• Greedy Approximation
• On the Classification of Biorthogonal Sequences
• On the existence of almost greedy bases in Banach spaces
• A bounded orthonormal system of polygonals
• Biorthogonal systems in Banach spaces
• Greedy algorithm for general biorthogonal systems

This page was built for publication: Lebesgue inequalities for Chebyshev thresholding greedy algorithms