Rescaled Pure Greedy Algorithm for Hilbert and Banach Spaces
classification
🧮 math.NA
cs.NA
keywords
algorithmbanachdictionarygreedyhilbertpureapproximatingclass
read the original abstract
We show that a very simple modification of the Pure Greedy Algorithm for approximating functions by sparse sums from a dictionary in a Hilbert or more generally a Banach space has optimal convergence rates on the class of convex combinations of dictionary elements
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.