Rate of convergence of pure greedy algorithms

被引：6

作者：

Livshits, ED ^{[1
]}

机构：

[1] Moscow MV Lomonosov State Univ, Moscow, Russia

来源：

MATHEMATICAL NOTES | 2004年 / 76卷 / 3-4期

基金：

俄罗斯基础研究基金会;

关键词：

pure greedy algorithm; Hilbert space; rate of convergence of pure greedy algorithms;

D O I：

10.1023/B:MATN.0000043480.05267.e7

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

This paper is devoted to the study of the rate of convergence of pure greedy algorithms in Hilbert space. We obtain upper bounds for the rate of convergence of pure,greedy algorithms for functions from the class A(alpha,beta)(D).

引用

页码：497 / 510

页数：14

共 50 条

[1] Rate of Convergence of Pure Greedy Algorithms
E. D. Livshits
Mathematical Notes, 2004, 76 : 497 - 510
[2] Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
Dereventsov, A. V.
MATHEMATICAL NOTES, 2012, 92 (3-4) : 485 - 489
[3] Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
A. V. Dereventsov
Mathematical Notes, 2012, 92 : 485 - 489
[4] On the Rate of Convergence of Greedy Algorithms
Temlyakov, Vladimir
MATHEMATICS, 2023, 11 (11)
[5] Rate of Convergence of Greedy Algorithms
A. V. Sil'nichenko
Mathematical Notes, 2004, 76 : 582 - 586
[6] Rate of convergence of greedy algorithms
Sil'nichenko, AV
MATHEMATICAL NOTES, 2004, 76 (3-4) : 582 - 586
[7] Rate of convergence of Thresholding Greedy Algorithms
Temlyakov, V. N.
SBORNIK MATHEMATICS, 2024, 215 (02) : 275 - 289
[8] Lower bounds for the rate of convergence of greedy algorithms
Livshits, E. D.
IZVESTIYA MATHEMATICS, 2009, 73 (06) : 1197 - 1215
[9] Convergence and rate of convergence of some greedy algorithms in convex optimization
V. N. Temlyakov
Proceedings of the Steklov Institute of Mathematics, 2016, 293 : 325 - 337
[10] Convergence and rate of convergence of some greedy algorithms in convex optimization
Temlyakov, V. N.
PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2016, 293 (01) : 325 - 337

← 1 2 3 4 5 →