Optimality of the greedy algorithm for some function classes
From MaRDI portal
Recommendations
- Sufficient conditions for the optimality of the greedy algorithm in greedoids
- A class of greedy algorithms and its relation to greedoids
- scientific article; zbMATH DE number 1985660
- Greedy in Approximation Algorithms
- Publication:3477901
- Approximately optimal algorithms for determining extrema in a certain class of functions
- The classification of greedy algorithms
- Convergence of the greedy algorithm for continuous functions
- Greedy Algorithms and Rational Approximation in One and Several Variables
- scientific article; zbMATH DE number 746906
Cited in
(11)- The best m-term approximation and greedy algorithms
- Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
- Sufficient conditions for the optimality of the greedy algorithm in greedoids
- Greedy algorithm for functions with low mixed smoothness
- Nonlinear approximation by the trigonometric system in weighted L_^p spaces
- Lower bounds for the rate of convergence of greedy algorithms
- On the recursive greedy algorithm
- On the rate of convergence of a pure greedy algorithm.
- Optimality of the rescaled pure greedy learning algorithms
- Prudent k-choice functions: Properties and algorithms
- On performance of greedy algorithms
This page was built for publication: Optimality of the greedy algorithm for some function classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3534169)
