|
Conical Greedy Algorithm
M. A. Valovab a Lomonosov Moscow State University
b Moscow Center for Fundamental and Applied Mathematics
Abstract:
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.
Keywords:
greedy algorithm, cone, convergence, dictionary, approximation.
Received: 19.01.2022 Revised: 26.03.2022
Citation:
M. A. Valov, “Conical Greedy Algorithm”, Mat. Zametki, 112:2 (2022), 163–169; Math. Notes, 112:2 (2022), 171–176
Linking options:
https://www.mathnet.ru/eng/mzm13424https://doi.org/10.4213/mzm13424 https://www.mathnet.ru/eng/mzm/v112/i2/p163
|
Statistics & downloads: |
Abstract page: | 237 | Full-text PDF : | 63 | References: | 56 | First page: | 18 |
|