On greedy algorithms for dictionaries with bounded cumulative coherence

被引:1
|
作者
Livshits, E. D. [1 ]
机构
[1] Evernote Corp, Moscow, Russia
基金
俄罗斯基础研究基金会;
关键词
greedy algorithm; pure greedy algorithm; orthogonal greedy algorithm; sparse approximation; cumulative coherence of a dictionary; Hilbert space; REPRESENTATIONS; APPROXIMATION;
D O I
10.1134/S0001434610050159
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
[No abstract available]
引用
收藏
页码:774 / 778
页数:5
相关论文
共 50 条
  • [21] Realizability of greedy algorithms
    E. D. Livshits
    Proceedings of the Steklov Institute of Mathematics, 2011, 273 : 107 - 115
  • [22] The classification of greedy algorithms
    Curtis, SA
    SCIENCE OF COMPUTER PROGRAMMING, 2003, 49 (1-3) : 125 - 157
  • [23] Weak greedy algorithms
    Temlyakov, VN
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 2000, 12 (2-3) : 213 - 227
  • [24] Beware greedy algorithms
    Simmons, Benno I.
    Hoeppke, Christoph
    Sutherland, William J.
    JOURNAL OF ANIMAL ECOLOGY, 2019, 88 (05) : 804 - 807
  • [25] Greedy in approximation algorithms
    Mestre, Julian
    ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 528 - 539
  • [26] Realizability of greedy algorithms
    Livshits, E. D.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2010, 16 (04): : 228 - 236
  • [27] Greedy wavelet projections are bounded on BV
    Bechler, Pawel
    Devore, Ronald
    Kamont, Anna
    Petrova, Guergana
    Wojtaszczyk, Przemyslaw
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2007, 359 (02) : 619 - 635
  • [28] Almost Optimality of the Orthogonal Super Greedy Algorithm for μ-Coherent Dictionaries
    Shao, Chunfang
    Chang, Jincai
    Ye, Peixin
    Zhang, Wenhui
    Xing, Shuo
    AXIOMS, 2022, 11 (05)
  • [29] The rate of convergence of weak greedy approximations over orthogonal dictionaries
    Orlova A.S.
    Moscow University Mathematics Bulletin, 2017, 72 (2) : 84 - 87
  • [30] Simultaneous approximation by greedy algorithms
    Leviatan, D.
    Temlyakov, V. N.
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 2006, 25 (1-3) : 73 - 90