Rescaled Pure Greedy Algorithm for Hilbert and Banach Spaces

2015/05/14 by Petrova, Guergana
#FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.1505.03604

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

Related

• Rescaled Pure Greedy Algorithm for Convex Optimization
• Greedy algorithms: a review and open problems
• On the rate of convergence of greedy algorithms
• Greedy expansions in convex optimization
• Greedy approximation in convex optimization