Some remarks on greedy algorithms
type: Item
instance of: scholarly article
title: Some remarks on greedy algorithms
zbMATH Open document ID: 0857.65016
DOI: 10.1007/BF02124742
author: Ronald DeVore
author: V. N. Temlyakov
published in: Advances in Computational Mathematics
publication date: 1997-03-09T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65D15
Mathematics Subject Classification ID: 41A65
Mathematics Subject Classification ID: 65J05
zbMATH DE Number: 934187
zbMATH Keywords: rate of approximation
zbMATH Keywords: greedy algorithms
zbMATH Keywords: Hilbert space
reviewed by: Antonio López-Carmona
MaRDI profile type: Publication
cites work: Universal approximation bounds for superpositions of a sigmoidal function
cites work: Compression of Wavelet Decompositions
cites work: A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
cites work: Adaptive greedy approximations
cites work: Q3229514
description: scientific article; zbMATH DE number 934187