Lebesgue-type inequalities for quasi-greedy bases

From MaRDI portal
Publication:387546

DOI10.1007/s00365-013-9209-zzbMath1284.41023arXiv1207.0946OpenAlexW1967146357MaRDI QIDQ387546

Eugenio Hernández, Gustavo Garrigós, Timur Oikhberg

Publication date: 23 December 2013

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

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




Related Items (25)

Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spacesLorentz spaces and embeddings induced by almost greedy bases in Banach spacesLebesgue constants for Chebyshev thresholding greedy algorithmsLebesgue-type inequalities in greedy approximationEfficiency of weak greedy algorithms for \(m\)-term approximationsNew parameters and Lebesgue-type estimates in greedy approximationLebesgue inequalities for the greedy algorithm in general basesWeak forms of unconditionality of bases in greedy approximationAsymptotic greediness of the Haar system in the spaces \(L_p[0,1\), \(1<p<\infty \)] ⋮ Characterization of 1-quasi-greedy basesWeight-almost greedy basesFourier coefficients of functions in power-weighted L2-spaces and conditionality constants of bases in Banach spacesLorentz spaces and embeddings induced by almost greedy bases in superreflexive Banach spacesLebesgue inequalities for Chebyshev thresholding greedy algorithmsSparse Approximation by Greedy AlgorithmsBidemocratic bases and their connections with other greedy-type basesBuilding highly conditional almost greedy and quasi-greedy bases in Banach spacesQuasi-greedy bases in \(\ell_p\) (\(0 < p < 1\)) are democraticOn certain subspaces of \(\ell_p\) for \(0 < p \le 1\) and their applications to conditional quasi-greedy bases in \(p\)-Banach spacesConditional quasi-greedy bases in non-superreflexive Banach spacesEquivalence between almost-greedy and semi-greedy basesStrong partially greedy bases and Lebesgue-type inequalitiesGreedy approximation for biorthogonal systems in quasi-Banach spacesVariations of property (A) constants and Lebesgue-type inequalities for the weak thresholding greedy algorithmsLebesgue constants for the weak greedy algorithm



Cites Work


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