On the rate of convergence of greedy algorithms.

DOI10.1023/B:MATN.0000043488.98673.79zbMATH Open1132.41345MaRDI QIDQ556573FDOQ556573

Authors: A. V. Sil'nichenko 

Publication date: 21 June 2005

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

Recommendations

• Some remarks on greedy algorithms
• On the rate of convergence of a pure greedy algorithm.
• The rate of convergence of weak greedy approximations over orthogonal dictionaries
• Two lower estimates in greedy approximation
• Greedy expansions in Hilbert spaces

zbMATH Keywords

Hilbert spacedifference-differential inequalitiespure greedy algorithmrate of convergence of greedy algorithms

Mathematics Subject Classification ID

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

Cited In (13)

• A convergence rate estimate for remotest projections on three subspaces
• Lower bounds for the rate of convergence of greedy algorithms
• On the rate of convergence of a pure greedy algorithm.
• Two lower estimates in greedy approximation
• Alternating projections, remotest projections, and greedy approximation
• Rescaled pure greedy algorithm for Hilbert and Banach spaces
• Uniform approximation rates and metric entropy of shallow neural networks
• On the von Neumann alternating algorithm in Hilbert space
• The rate of convergence of weak greedy approximations over orthogonal dictionaries
• On convergence of weak greedy algorithms
• Characterization of the variation spaces corresponding to shallow neural networks
• Entropy-based convergence rates of greedy algorithms
• A criterion for convergence of weak greedy algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q556573)