arXiv · 1505.03604
Rescaled Pure Greedy Algorithm for Hilbert and Banach Spaces
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
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Guergana Petrova. 2015-05-14. Rescaled Pure Greedy Algorithm for Hilbert and Banach Spaces. https://arxiv.org/abs/1505.03604
Cite the original work for its findings. Save a collection to share your selection of sources.