Abstract:
Convergence rate of weak orthogonal greedy algorithm is studied for the subspace $\ell^1\subset\ell^2$ and orthogonal dictionaries. It is shown that general results on convergence rate of weak orthogonal greedy algorithms can be essentially improved in the studied case. It is also shown that this improvement is asymptotically sharp.
Fulltext:
PDF file (232 kB)