Rescaled Pure Greedy Algorithm for Hilbert and Banach Spaces
Numerical Analysis
2015-05-15 v1
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
Keywords
Cite
@article{arxiv.1505.03604,
title = {Rescaled Pure Greedy Algorithm for Hilbert and Banach Spaces},
author = {Guergana Petrova},
journal= {arXiv preprint arXiv:1505.03604},
year = {2015}
}