Noisy Information: Optimality, Complexity, Tractability

DOI10.1007/978-3-642-41095-6_7zbMath1302.65017OpenAlexW204703929MaRDI QIDQ2926215

Leszek Plaskota

Publication date: 31 October 2014

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-41095-6_7

zbMATH Keywords

algorithmMonte Carloinformation-based complexitynoisy informationworst case settinglinear multivariate problemsapproximation of functionals

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Algorithms for approximation of functions (65D15) Complexity and performance of numerical algorithms (65Y20)

Related Items (4)

Euler scheme for approximation of solution of nonlinear ODEs under inexact information ⋮ Approximation of piecewise Hölder functions from inexact information ⋮ Optimal approximation of stochastic integrals in analytic noise model ⋮ On the optimal robust solution of IVPs with noisy information

This page was built for publication: Noisy Information: Optimality, Complexity, Tractability