Some remarks on greedy algorithms (Q1923887)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some remarks on greedy algorithms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some remarks on greedy algorithms |
scientific article |
Statements
Some remarks on greedy algorithms (English)
0 references
9 March 1997
0 references
The authors develop estimates for the rate of approximation for certain classes of functions and study certain greedy algorithms. They restrict their study to the case where approximation takes place in a real, separable Hilbert space and study three greedy algorithms: the pure greedy algorithm, an orthogonal greedy algorithm, and a relaxed greedy algorithm.
0 references
rate of approximation
0 references
greedy algorithms
0 references
Hilbert space
0 references
