Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces

DOI10.1007/s00365-018-9415-9zbMath1404.41011arXiv1707.07513OpenAlexW2964119647MaRDI QIDQ1615982

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

Publication date: 31 October 2018

Published in: Constructive Approximation (Search for Journal in Brave)

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

zbMATH Keywords

greedy algorithmnon-linear approximationbiorthogonal systemquasi-greedy basisgreedy basisdiscrete Lorentz spaceLebesgue-type constantLebesgue-type inequality

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15) Banach sequence spaces (46B45) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Related Items (15)

Extensions of democracy-like properties for sequences with gaps ⋮ New parameters and Lebesgue-type estimates in greedy approximation ⋮ Sparse approximation using new greedy-like bases in superreflexive spaces ⋮ Fourier coefficients of functions in power-weighted L₂-spaces and conditionality constants of bases in Banach spaces ⋮ Lorentz spaces and embeddings induced by almost greedy bases in superreflexive Banach spaces ⋮ Lebesgue inequalities for Chebyshev thresholding greedy algorithms ⋮ Bidemocratic bases and their connections with other greedy-type bases ⋮ Building highly conditional almost greedy and quasi-greedy bases in Banach spaces ⋮ Quasi-greedy bases in \(\ell_p\) (\(0 < p < 1\)) are democratic ⋮ On certain subspaces of \(\ell_p\) for \(0 < p \le 1\) and their applications to conditional quasi-greedy bases in \(p\)-Banach spaces ⋮ Quasi-greedy bases for sequences with gaps ⋮ Characterization of weight-semi-greedy bases ⋮ Strong partially greedy bases and Lebesgue-type inequalities ⋮ A remark on approximation with polynomials and greedy bases ⋮ Greedy approximation for biorthogonal systems in quasi-Banach spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lorentz spaces and embeddings induced by almost greedy bases in Banach spaces
• Lebesgue-type inequalities for quasi-greedy bases
• Democracy functions and optimal embeddings for approximation spaces
• Greedy bases are best for \(m\)-term approximation
• The best \(m\)-term approximation and greedy algorithms
• Greedy algorithm and \(m\)-term trigonometric approximation
• The thresholding greedy algorithm, greedy bases, and duality
• Lebesgue inequalities for the greedy algorithm in general 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
• Greedy Approximation
• Quasi-greedy bases and Lebesgue-type inequalities
• Recent developments in the theory of Lorentz spaces and weighted inequalities
• A conditional quasi-greedy basis of l₁
• On the existence of almost greedy bases in Banach spaces
• Some curious bases for $c_{0}$ and C[0,1]
• Biorthogonal systems in Banach spaces
• Greedy algorithm for general biorthogonal systems
• Functional analysis and infinite-dimensional geometry
• Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems

This page was built for publication: Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces