On the rate of convergence of greedy algorithms.

DOI10.1023/B:MATN.0000043488.98673.79zbMath1132.41345MaRDI QIDQ556573

A. V. Sil'nichenko

Publication date: 21 June 2005

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

Hilbert spacepure greedy algorithmdifference-differential inequalitiesrate of convergence of greedy algorithms

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items (6)

Rescaled pure greedy algorithm for Hilbert and Banach spaces ⋮ Uniform approximation rates and metric entropy of shallow neural networks ⋮ The rate of convergence of weak greedy approximations over orthogonal dictionaries ⋮ Characterization of the variation spaces corresponding to shallow neural networks ⋮ A convergence rate estimate for remotest projections on three subspaces ⋮ Alternating projections, remotest projections, and greedy approximation

This page was built for publication: On the rate of convergence of greedy algorithms.