Sparse approximation using new greedy-like bases in superreflexive spaces

DOI10.4064/SM220506-3-2MaRDI QIDQ6085653zbMATH OpenOpenAlexFDO

Authors F. Albiac, J. L. Ansorena, M. Berasategui

Publication date 8 November 2023

Published in Studia Mathematica (Search for Journal in Brave)

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

zbMATH Keywords

thresholding greedy algorithmsuperreflexive Banach spacesbidemocratic basesunconditionality constants

Mathematics Subject Classification ID

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

Abstract: This paper is devoted to theoretical aspects on optimality of sparse approximation. We undertake a quantitative study of new types of greedy-like bases that have recently arisen in the context of nonlinear $m$-term approximation in Banach spaces as a generalization of the properties that characterize almost greedy bases, i.e., quasi-greediness and democracy. As a means to compare the efficiency of these new bases with already existing ones in regards to the implementation of the Thresholding Greedy Algorithm, we place emphasis on obtaining estimates for their sequence of unconditionality parameters. Using an enhanced version of the original method from [S. J. Dilworth, N. J. Kalton, and D. Kutzarova, On the existence of almost greedy bases in Banach spaces, Studia Math. 159 (2003), no. 1, 67-101] for building almost greedy bases, we manage to construct bidemocratic bases whose unconditionality parameters satisfy significantly worse estimates than almost greedy bases even in Hilbert spaces.

Recommendations

• Sparse approximation and recovery by greedy algorithms in Banach spaces
• Sparse approximation by greedy algorithms
• Sparse Approximation and Recovery by Greedy Algorithms
• Sparse approximation based on a random overcomplete basis
• The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
• On sparse representation in pairs of bases
• On Sparse Representation in Fourier and Local Bases
• Sparse representations and approximation theory
• On Sparse Representations in Arbitrary Redundant Bases
• Sparse total least squares: analysis and greedy algorithms

Cites work

• scientific article; zbMATH DE number 3563703 (Why is no real title available?)
• scientific article; zbMATH DE number 3626044 (Why is no real title available?)
• scientific article; zbMATH DE number 3315557 (Why is no real title available?)
• A counterexample to the approximation problem in Banach spaces
• A note on subsymmetric renormings of Banach spaces
• A remark on greedy approximation in Banach spaces.
• Bidemocratic bases and their connections with other greedy-type bases
• Biorthogonal systems in Banach spaces
• Building highly conditional almost greedy and quasi-greedy bases in Banach spaces
• Conditional quasi-greedy bases in non-superreflexive Banach spaces
• Conditionality constants of quasi-greedy bases in super-reflexive Banach spaces
• Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces
• Fourier coefficients of functions in power-weighted L₂-spaces and conditionality constants of bases in Banach spaces
• Greedy algorithm for general biorthogonal systems
• Greedy approximation for biorthogonal systems in quasi-Banach spaces
• Lebesgue inequalities for the greedy algorithm in general bases
• Lorentz spaces and embeddings induced by almost greedy bases in Banach spaces
• Lorentz spaces and embeddings induced by almost greedy bases in superreflexive Banach spaces
• New parameters and Lebesgue-type estimates in greedy approximation
• On certain subspaces of \(\ell_p\) for \(0 < p \le 1\) and their applications to conditional quasi-greedy bases in \(p\)-Banach spaces
• On left democracy function
• On the existence of almost greedy bases in Banach spaces
• Quasi-greedy bases and Lebesgue-type inequalities
• Quasi-greedy bases in \(\ell_p\) (\(0 < p < 1\)) are democratic
• The thresholding greedy algorithm, greedy bases, and duality
• Topics in Banach Space Theory
• Weak forms of unconditionality of bases in greedy approximation

Cited in

(3)

• Twenty-five years of greedy bases
• Linear versus nonlinear forms of partial unconditionality of bases
• Lorentz spaces and embeddings induced by almost greedy bases in superreflexive Banach spaces

This page was built for publication: Sparse approximation using new greedy-like bases in superreflexive spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085653)