Quasi-greedy bases and Lebesgue-type inequalities

DOI10.4064/sm211-1-3zbMath1264.41032OpenAlexW2017285636MaRDI QIDQ3164871

Moisés Soto-Bajo, Vladimir N. Temlyakov, Stephen Dilworth

Publication date: 17 October 2012

Published in: Studia Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/sm211-1-3

zbMATH Keywords

greedy algorithmsquasi-greedy basesLebesgue-type inequalities

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Rate of convergence, degree of approximation (41A25)

Related Items (23)

Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces ⋮ Lorentz spaces and embeddings induced by almost greedy bases in Banach spaces ⋮ Lebesgue-type inequalities in greedy approximation ⋮ Efficiency of weak greedy algorithms for \(m\)-term approximations ⋮ New parameters and Lebesgue-type estimates in greedy approximation ⋮ Fundamental functions of almost greedy bases of \(L_p\) for \(1<p< \infty\) ⋮ Lebesgue inequalities for the greedy algorithm in general bases ⋮ Conditionality constants of quasi-greedy bases in super-reflexive Banach spaces ⋮ Lebesgue-type inequalities for quasi-greedy bases ⋮ Weak forms of unconditionality of bases in greedy approximation ⋮ Greedy algorithm with gaps ⋮ Sparse approximation using new greedy-like bases in superreflexive spaces ⋮ Weight-almost greedy bases ⋮ Greedy-like bases for sequences with gaps ⋮ Sparse Approximation by Greedy Algorithms ⋮ 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 ⋮ 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 ⋮ Lebesgue constants for the weak greedy algorithm ⋮ SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES

This page was built for publication: Quasi-greedy bases and Lebesgue-type inequalities