Rate of convergence of pure greedy algorithm.

MaRDI QIDQ2752680zbMATH OpenFDO

Authors Sergei Konyagin, V. N. Temlyakov

Publication date 16 October 2001

Published in East Journal on Approximations (Search for Journal in Brave)

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Rate of convergence, degree of approximation (41A25)

Cited in

(14)

• High-dimensional L₂-Boosting: rate of convergence
• Greedy algorithms for prediction
• Error bounds of approximate weak rescaled pure greedy algorithms
• On the divergence of greedy algorithms with respect to Walsh subsystems in L
• Greedy expansions in Hilbert spaces
• Approximation and learning by greedy algorithms
• Efficiency of the weak Rescaled Pure Greedy Algorithm
• Rescaled pure greedy algorithm for Hilbert and Banach spaces
• Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
• Results and questions on a nonlinear approximation approach for solving high-dimensional partial differential equations
• Brief introduction in greedy approximation
• Simultaneous approximation by greedy algorithms
• Greedy expansions in Banach spaces
• -Rescaled Pure Super Greedy Algorithm with respect to Riesz dictionary

This page was built for publication: Rate of convergence of pure greedy algorithm.

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