Lebesgue-type inequalities in greedy approximation

DOI10.1007/978-3-319-27873-5_4zbMATH Open1458.41010arXiv1909.13536OpenAlexW3111953592MaRDI QIDQ826481FDOQ826481

Authors: S. J. Dilworth, Gustavo Garrigós, E. Hernández, D. Kutzarova, V. N. Temlyakov 

Publication date: 4 January 2021

Published in: Journal of Functional Analysis, New Trends in Applied Harmonic Analysis (Search for Journal in Brave)

Abstract: We present new results regarding Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA) in uniformly smooth Banach spaces. We improve earlier bounds in Temlyakov (Forum Math Sigma 2014), for dictionaries satisfying a new property introduced here. We apply these results to derive optimal bounds in two natural examples of sequence spaces. In particular, optimality is obtained in the case of the multivariate Haar system in Lp with 1<p<2, under the Littlewood-Paley norm.

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

Recommendations

• Sparse approximation of individual functions
• Convergence of some greedy algorithms in Banach spaces
• Metric entropy and sparse linear approximation of \(\ell_q\)-hulls for \(0<q\leq 1\)
• Sparse approximation by greedy algorithms
• On Lebesgue-type inequalities for greedy approximation
• Rescaled pure greedy algorithm for Hilbert and Banach spaces
• Greedy approximation in Banach spaces
• Greedy approximation
• Lebesgue-type inequalities in greedy approximation
• Lebesgue-type inequalities for quasi-greedy bases

zbMATH Keywords

non-linear approximationuniformly smooth Banach spaceweak Chebyshev greedy algorithmthresholding greedy algorithm

Mathematics Subject Classification ID

Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Trigonometric approximation (42A10) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Geometry and structure of normed linear spaces (46B20) Algorithms for approximation of functions (65D15) Rate of convergence, degree of approximation (41A25) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Cites Work

• Title not available (Why is that?)
• Multivariate Approximation
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
• Greed is Good: Algorithmic Results for Sparse Approximation
• Sparse Recovery With Orthogonal Matching Pursuit Under RIP
• The best \(m\)-term approximation and greedy algorithms
• Nonlinear methods of approximation
• The thresholding greedy algorithm, greedy bases, and duality
• A remark on greedy approximation in Banach spaces.
• Greedy approximation
• Greedy approximation
• Title not available (Why is that?)
• Greedy approximation and the multivariate Haar system
• Title not available (Why is that?)
• Sharp Jackson and Bernstein inequalities for N-term approximation in sequence spaces with applications
• Greedy algorithm for general biorthogonal systems
• Conditional quasi-greedy bases in Hilbert and Banach spaces
• Quasi-greedy bases and Lebesgue-type inequalities
• Bases, lacunary sequences and complemented subspaces in the spaces $L_{p}$
• Lebesgue-type inequalities for quasi-greedy bases
• On the existence of almost greedy bases in Banach spaces
• Weak convergence of greedy algorithms in Banach spaces
• Greedy algorithm and \(m\)-term trigonometric approximation
• Greedy approximation with regard to non-greedy bases
• An example of an almost greedy uniformly bounded orthonormal basis for \(L_p(0,1)\)
• Sparse approximation and recovery by greedy algorithms in Banach spaces
• Title not available (Why is that?)
• Greedy algorithms in Banach spaces
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Constructive sparse trigonometric approximation and other problems for functions with mixed smoothness
• On Lebesgue-type inequalities for greedy approximation
• On performance of greedy algorithms
• On the moduli of convexity and smoothness
• Some remarks on nonlinear approximation with Schauder bases
• Approximation by polynomials of given length
• Function spaces with dominating mixed smoothness
• On the smoothness and convexity of Besov spaces
• Lebesgue-Type Inequalities for Greedy Approximation in Banach Spaces
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Lebesgue-type inequalities in greedy approximation
• Unified error estimate for weak biorthogonal Greedy algorithms
• On Lebesgue-type inequalities for greedy approximation
• The thresholding greedy algorithm versus approximations with sizes bounded by certain functions \(f\)
• Greedy-type approximation in Banach spaces and applications

Uses Software

• CoSaMP

This page was built for publication: Lebesgue-type inequalities in greedy approximation

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