A stochastic analog to Chebyshev centers and optimal average case algorithms

DOI10.1016/0885-064X(89)90013-7zbMath0667.60008MaRDI QIDQ1117550

Klaus Ritter, Erich Novak

Publication date: 1989

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

optimal average case algorithmsstochastic analogue to Chebyshev centers in a metric space

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Probability theory on algebraic and topological structures (60B99)

Related Items (1)

On the information-based complexity of optimal reconstruction for nonlinear systems

Cites Work

• Can adaption help on the average?
• Average case optimality
• Approximation of linear functionals on a Banach space with a Gaussian measure
• Optimal algorithms for linear problems with Gaussian measures
• Best coapproximation in normed linear spaces
• Points minimaux et ensembles optimaux dans les espaces de Banach
• The best possible net and the best possible cross-section of a set in a normed space
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A stochastic analog to Chebyshev centers and optimal average case algorithms