Conical Greedy Algorithm

作     者：Valov, M. A. 

作者机构：Lomonosov Moscow State Univ Moscow 119991 Russia Moscow Ctr Fundamental & Appl Math Moscow 119991 Russia 

出 版 物：《MATHEMATICAL NOTES》 (数学札记)

年 卷 期：2022年第112卷第1-2期

页      面：171-176页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：greedy algorithm cone convergence dictionary approximation 

摘      要：A weak conical greedy algorithm is introduced with respect to an arbitrary positive complete dictionary in a Hilbert space;this algorithm gives an approximation of an arbitrary space element by a combination of dictionary elements with nonnegative coefficients. The convergence of this algorithm is proved and an estimate of the convergence rate for the elements of the convex hull of the dictionary is given.