Realizability of greedy algorithms

被引:0
|
作者
E. D. Livshits
机构
[1] Evernote Corp.,
关键词
best ; -term approximation; greedy algorithms; category;
D O I
暂无
中图分类号
学科分类号
摘要
A purely greedy algorithm and an orthogonal greedy algorithm are studied. It is established that the set of objective functions for which a greedy algorithm can be “realized correctly” has second category for discrete dictionaries.
引用
收藏
页码:107 / 115
页数:8
相关论文
共 50 条
  • [11] Weak greedy algorithms
    Temlyakov, VN
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 2000, 12 (2-3) : 213 - 227
  • [12] Greedy in approximation algorithms
    Mestre, Julian
    ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 528 - 539
  • [13] On the Rate of Convergence of Greedy Algorithms
    Temlyakov, Vladimir
    MATHEMATICS, 2023, 11 (11)
  • [14] Simultaneous approximation by greedy algorithms
    Leviatan, D.
    Temlyakov, V. N.
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 2006, 25 (1-3) : 73 - 90
  • [15] THE CANONICAL ORDER AND GREEDY ALGORITHMS
    KOVALEV, MM
    VASILKOV, DM
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 80 (02) : 446 - 450
  • [16] Approximate Weak Greedy Algorithms
    R. Gribonval
    M. Nielsen
    Advances in Computational Mathematics, 2001, 14 : 361 - 378
  • [17] Simultaneous approximation by greedy algorithms
    D. Leviatan
    V. N. Temlyakov
    Advances in Computational Mathematics, 2006, 25 : 73 - 90
  • [18] Dictionary preconditioning for greedy algorithms
    Schnass, Karin
    Vandergheynst, Pierre
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (05) : 1994 - 2002
  • [19] Adaptive approximations by greedy algorithms
    Cohen, Albert
    ICIAM 07: 6TH INTERNATIONAL CONGRESS ON INDUSTRIAL AND APPLIED MATHEMATICS, 2009, : 99 - 111
  • [20] Greedy spanner algorithms in practice
    Farshi, M.
    Nasab, M. J. Hekmat
    SCIENTIA IRANICA, 2014, 21 (06) : 2142 - 2152