Resealed pure greedy algorithm for Hilbert and Banach spaces

被引:12
|
作者
Petrova, Guergana [1 ]
机构
[1] Texas A&M Univ, Dept Math, College Stn, TX 77843 USA
基金
美国国家科学基金会;
关键词
Greedy algorithms; Rates of convergence; PROJECTION PURSUIT REGRESSION; APPROXIMATION; CONVERGENCE; RATES;
D O I
10.1016/j.acha.2015.10.008
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码:852 / 866
页数:15
相关论文
共 50 条