AbstractWe study approximation of linear functionals on separable Banach spaces equipped with a Gaussian measure. We study optimal information and optimal algorithms in average case, probabilistic, and asymptotic settings, for a general error criterion. We prove that adaptive information is not more powerful than nonadaptive information and that μ-spline algorithms, which are linear, are optimal in all three settings. Some of these results hold for approximation of linear operators. We specialize our results to the space of functions with continuous rth derivatives, equipped with a Wiener measure. In particular, we show that the natural splines of degree 2r + I yield the optimal algorithms. We apply the general results to the problem of int...
AbstractThe problem of estimating linear functionals based on Gaussian observations is considered. P...
AbstractThis paper studies optimal information and optimal algorithms in Hilbert space for an n-dime...
AbstractThe complexity of approximating a continuous linear functional defined on a separable Banach...
AbstractWe study approximation of linear functionals on separable Banach spaces equipped with a Gaus...
This work consists of three parts. The first two describe new results In information-based complexit...
We study optimal algorithms and optimal information in an average case model for linear problems in ...
AbstractThe complexity of approximating a continuous linear functional defined on a separable Banach...
AbstractIt is shown that a Gaussian measure in a given infinite-dimensional Banach space always admi...
We study optimal algorithms for linear problems in two settings: the average case and the probabilis...
This work consists of three parts. The first two describe new results In information-based complexit...
This work consists of three parts. The first two describe new results In information-based complexit...
AbstractWe study algorithms for the approximation of functions, the error is measured in an L2 norm....
AbstractWe study the minimal cost of information (called the information complexity) for approximati...
AbstractWe study the average complexity of linear problems, on a separable Banach space equipped wit...
AbstractWe study the minimal cost of information (called the information complexity) for approximati...
AbstractThe problem of estimating linear functionals based on Gaussian observations is considered. P...
AbstractThis paper studies optimal information and optimal algorithms in Hilbert space for an n-dime...
AbstractThe complexity of approximating a continuous linear functional defined on a separable Banach...
AbstractWe study approximation of linear functionals on separable Banach spaces equipped with a Gaus...
This work consists of three parts. The first two describe new results In information-based complexit...
We study optimal algorithms and optimal information in an average case model for linear problems in ...
AbstractThe complexity of approximating a continuous linear functional defined on a separable Banach...
AbstractIt is shown that a Gaussian measure in a given infinite-dimensional Banach space always admi...
We study optimal algorithms for linear problems in two settings: the average case and the probabilis...
This work consists of three parts. The first two describe new results In information-based complexit...
This work consists of three parts. The first two describe new results In information-based complexit...
AbstractWe study algorithms for the approximation of functions, the error is measured in an L2 norm....
AbstractWe study the minimal cost of information (called the information complexity) for approximati...
AbstractWe study the average complexity of linear problems, on a separable Banach space equipped wit...
AbstractWe study the minimal cost of information (called the information complexity) for approximati...
AbstractThe problem of estimating linear functionals based on Gaussian observations is considered. P...
AbstractThis paper studies optimal information and optimal algorithms in Hilbert space for an n-dime...
AbstractThe complexity of approximating a continuous linear functional defined on a separable Banach...