Weak greedy algorithms for nonlinear approximation with quasi-greedy bases

被引：0
|
作者：
Jingfan, Long [1 ]
Peixin, Ye [2 ]
机构：
[1] Department of Mathematics, Beijing Information Science and Technology University, Beijing, Chaoyang, China
[2] School of Mathematical Sciences, LPMC, Nankai University, Tianjin, China
来源：
WSEAS Transactions on Mathematics | 2014年 / 13卷 / 01期
关键词：
33;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：525 / 534
相关论文
共 50 条
  • [31] Simultaneous approximation by greedy algorithms
    Leviatan, D.
    Temlyakov, V. N.
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 2006, 25 (1-3) : 73 - 90
  • [32] Simultaneous approximation by greedy algorithms
    D. Leviatan
    V. N. Temlyakov
    Advances in Computational Mathematics, 2006, 25 : 73 - 90
  • [33] Approximate weak greedy algorithms
    Gribonval, R
    Nielsen, M
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 2001, 14 (04) : 361 - 378
  • [34] Sparse Approximation by Greedy Algorithms
    Temlyakov, V.
    MATHEMATICAL ANALYSIS, PROBABILITY AND APPLICATIONS - PLENARY LECTURES, 2016, 177 : 183 - 215
  • [35] Approximation and learning by greedy algorithms
    Barron, Andrew R.
    Cohen, Albert
    Dahmen, Wolfgang
    DeVore, Ronald A.
    ANNALS OF STATISTICS, 2008, 36 (01): : 64 - 94
  • [36] A remark on approximation with polynomials and greedy bases
    Berna, Pablo M.
    Perez, Antonio
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2019, 478 (02) : 466 - 475
  • [37] A Criterion for Convergence of Weak Greedy Algorithms
    V.N. Temlyakov
    Advances in Computational Mathematics, 2002, 17 : 269 - 280
  • [38] Sparse Approximation and Recovery by Greedy Algorithms
    Livshitz, Eugene D.
    Temlyakov, Vladimir N.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (07) : 3989 - 4000
  • [39] Generalized Approximate Weak Greedy Algorithms
    V. V. Galatenko
    E. D. Livshits
    Mathematical Notes, 2005, 78 : 170 - 184
  • [40] GREEDY APPROXIMATION ALGORITHMS FOR SPARSE COLLECTIONS
    Rey, Guillermo
    PUBLICACIONS MATEMATIQUES, 2024, 68 (01) : 251 - 265
12345