A closed-form convergence criterion for the weak greedy algorithm (opens in new tab)

In 2002, V. N. Temlyakov established a criterion for the convergence of the weak greedy algorithm in a Hilbert space for a given weakness sequence $ \tau = \{t_1,t_2,\ldots\} $. The criterion requires verifying a certain limiting relation for every nonnegative square-summable sequence. We give an equivalent closed-form criterion: the weak greedy algorithm converges if and only if $ \sum_{n=1}^{\infty}(1+ n\sum_{k=1}^{n}t_k^2 )^{-1/2}t_n^2=+\inft...