Information of varying cardinality
From MaRDI portal
Publication:1821084
DOI10.1016/0885-064X(86)90002-6zbMath0615.94004MaRDI QIDQ1821084
Publication date: 1986
Published in: Journal of Complexity (Search for Journal in Brave)
Gaussian measures; worst case setting; average case setting; adaptive information of varying cardinality; linear problems defined on a separable Banach space
Related Items
Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure, Average-Case Optimality of a Hybrid Secant-Bisection Method, Nonlinear Lebesgue and Itô integration problems of high complexity, Approximate evaluations of characteristic polynomials of Boolean functions, Average complexity for linear operators over bounded domains, Mixed settings for linear problems, On average complexity of global optimization problems, Average case complexity of weighted approximation and integration over \(\mathbb R_{+}\), Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure, Adaptive Itô-Taylor algorithm can optimally approximate the Itô integrals of singular functions, Polynomial-time algorithms for multivariate linear problems with finite-order weights: Average case setting, Linear information for approximation of the Itô integrals, Average case optimality, A survey of information-based complexity, Approximation of linear functionals on a Banach space with a Gaussian measure, Probabilistic setting of information-based complexity, Complexity of approximation with relative error criterion in worst, average, and probabilistic settings, An information-based approach to ill-posed problems, The algorithm designer versus nature: A game-theoretic approach to information-based complexity, Complexity of fixed points. I, Stochastic properties of quadrature formulas, On adaption with noisy information, Randomization for continuous problems, Optimal algorithms for a problem of optimal control, Measures of uncertainty and information in computation, Average case complexity of linear multivariate problems. I: Theory, On adaptive information with varying cardinality for linear problems with elliptically contoured measures, Integration and \(L_ 2\)-approximation: Average case setting with isotropic Wiener measure for smooth functions, Information-based nonlinear approximation: an average case setting, Optimal designs for weighted approximation and integration of stochastic processes on \([0,\infty)\), Testing linear operators, On average case complexity of linear problems with noisy information, On the complexity of stochastic integration, The power of adaption for approximating functions with singularities, Average case complexity of multivariate integration, On the exponent of discrepancies, Recent developments in information-based complexity, On the Power of Adaptive Information for Functions with Singularities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the average complexity of multivariate problems
- Can adaption help on the average?
- Average case optimality for linear problems
- Average case optimality
- Average case optimal algorithms in Hilbert spaces
- A survey of information-based complexity
- Approximation of linear functionals on a Banach space with a Gaussian measure
- Optimal algorithms for linear problems with Gaussian measures
- Probabilistic setting of information-based complexity
- On adaption with noisy information
- Some nonlinear problems are as easy as the approximation problem
- Optimal sequential and non-sequential procedures for evaluating a functional
- Perspectives on information-based complexity
- Designs for Regression Problems With Correlated Errors: Many Parameters
- On the Regression Design Problem of Sacks and Ylvisaker
- Designs for Regression Problems with Correlated Errors III
- On the optimality of linear methods for operator approximation in convex classes of functions
