Optimality of the greedy algorithm for some function classes

被引：6
|
作者：
Livshits, E. D. [1 ]
机构：
[1] Moscow MV Lomonosov State Univ, Moscow, Russia
来源：
SBORNIK MATHEMATICS | 2007年 / 198卷 / 5-6期
关键词：
D O I：
10.1070/SM2007v198n05ABEH003855
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The convergence rate of the pure greedy algorithm (PGA) is considered. Upper bounds for the convergence rate of the PGA are obtained in the case of the target function in the classes (A) over cap (gamma)(D), gamma >= 0, which are extensions of the class (A) over cap (1)(D). This bound is shown to be sharp in order for gamma >= 2.
引用
收藏
页码：691 / 709
页数：19
相关论文
共 50 条
12345