Optimal recovery and \(n\)-widths for convex classes of functions
type: Item
instance of: scholarly article
title: Optimal recovery and \(n\)-widths for convex classes of functions
zbMATH Open document ID: 0841.65037
published in: Journal of Approximation Theory
publication date: 1996-07-14T00:00:00Z
review text: The problem of optimal recovery is studied for a nonsymmetric convex class of functions. It is shown that adaptive methods may be much better than nonadaptive methods. The author defines certain Gelfand-type widths that are useful for nonsymmetric classes and proves relations to optimal error bounds for adaptive and nonadaptive methods, respectively.
reviewed by: Manfred Tasche
Mathematics Subject Classification ID: 65J05
Mathematics Subject Classification ID: 41A65
Mathematics Subject Classification ID: 41A46
zbMATH DE Number: 756635
zbMATH Keywords: optimal recovery
zbMATH Keywords: convex class of functions
zbMATH Keywords: adaptive methods
zbMATH Keywords: Gelfand-type widths
zbMATH Keywords: optimal error bounds
author: Erich Novak
MaRDI profile type: Publication
full work available at URL: jath.1995.1025
OpenAlex ID: W1970961270
DOI: 10.1006/JATH.1995.1025
description: scientific article; zbMATH DE number 756635