Lebesgue-type inequalities in greedy approximation
classification
🧮 math.FA
keywords
boundsgreedyinequalitieslebesgue-typeresultsspacesalgorithmapply
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.