Two lower estimates in greedy approximation

DOI10.1007/S00365-003-0533-6MaRDI QIDQ1423641zbMATH OpenOpenAlexFDO

Authors E. D. Livshitz, V. N. Temlyakov

Publication date 7 March 2004

Published in Constructive Approximation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00365-003-0533-6

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25)

Recommendations

• Some remarks on greedy algorithms
• Lower bounds for the rate of convergence of greedy algorithms
• On the rate of convergence of greedy algorithms.
• On the rate of convergence of a pure greedy algorithm.
• The convergence of the greedy algorithm with respect to the Haar system in the space \(L_{p}\)(0,1)

Cited in

(13)

• Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
• Efficiency of the weak Rescaled Pure Greedy Algorithm
• Approximation and learning by greedy algorithms
• Greedy expansions in Hilbert spaces
• On performance of greedy algorithms
• Results and questions on a nonlinear approximation approach for solving high-dimensional partial differential equations
• Lower bounds for the rate of convergence of greedy algorithms
• On the rate of convergence of greedy algorithms.
• Greedy expansions in Banach spaces
• Simultaneous greedy approximation in Banach spaces
• Vector greedy algorithms
• Rescaled pure greedy algorithm for Hilbert and Banach spaces
• Greedy algorithms for prediction

This page was built for publication: Two lower estimates in greedy approximation

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