Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms

DOI10.1134/S0001434612090209zbMath1262.65060MaRDI QIDQ1929788

A. V. Dereventsov

Publication date: 9 January 2013

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

zbMATH Keywords

rate of convergenceHilbert spacedictionarypure greedy algorithmorthogonal greedy algorithm

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05)

Cites Work

• Unnamed Item
• Unnamed Item
• On a conjecture of Huber concerning the convergence of projection pursuit regression
• A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
• Two lower estimates in greedy approximation
• Asymptotics of the module of a degenerating condenser and some of their applications
• Some remarks on greedy algorithms
• Weak greedy algorithms
• Generalized approximate weak greedy algorithms
• Lower bounds for the rate of convergence of greedy algorithms
• Remarks on projection pursuit regression and density estimation
• Universal approximation bounds for superpositions of a sigmoidal function
• Matching pursuits with time-frequency dictionaries
• Greedy algorithms in Banach spaces

This page was built for publication: Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms