Two lower estimates in greedy approximation
From MaRDI portal
Given an arbitrary Hilbert space with a denumerable orthonormal basis, the authors construct two examples providing lower estimates for the rate of convergence of the pure Greedy algorithm and of the weak Greedy algorithm, respectively.
Recommendations
Cited in
(19)- Some remarks on greedy algorithms
- Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
- Greedy expansions in Hilbert spaces
- Approximation and learning by greedy algorithms
- Greedy algorithms for prediction
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Lower bounds for the rate of convergence of greedy algorithms
- Efficiency of the weak Rescaled Pure Greedy Algorithm
- On the rate of convergence of greedy algorithms.
- Simultaneous greedy approximation in Banach spaces
- Vector greedy algorithms
- Brief introduction in greedy approximation
- -Rescaled Pure Super Greedy Algorithm with respect to Riesz dictionary
- High-dimensional L₂-Boosting: rate of convergence
- Error bounds of approximate weak rescaled pure greedy algorithms
- Approximation properties of some vector weak biorthogonal greedy algorithms
- On performance of greedy algorithms
- Results and questions on a nonlinear approximation approach for solving high-dimensional partial differential equations
- Greedy expansions in Banach spaces
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)
