s-numbers in information-based complexity
From MaRDI portal
Publication:757049
DOI10.1016/0885-064X(90)90011-2zbMath0723.68047OpenAlexW2482752784MaRDI QIDQ757049
Publication date: 1990
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0885-064x(90)90011-2
Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Related Items
Infinite-dimensional quadrature and approximation of distributions ⋮ Carl's inequality for quasi-Banach spaces ⋮ Perspectives on information-based complexity ⋮ Optimal approximation of elliptic problems by linear and nonlinear mappings. IV: Errors in \(L_{2}\) and other norms ⋮ The adaption problem for approximating linear operators ⋮ Bernstein \(n\)-width of Besov embeddings on Lipschitz domains ⋮ Exact asymptotic orders of various randomized widths on Besov classes ⋮ Exponential tractability of \(L_2\)-approximation with function values ⋮ Ultrastability of \(n\)th minimal errors ⋮ Estimates of probabilistic widths of the diagonal operator of finite-dimensional sets with the Gaussian measure ⋮ Continuous algorithms in \(n\)-term approximation and nonlinear widths ⋮ Random approximation of Sobolev embeddings ⋮ Complexity of linear problems with a fixed output basis ⋮ Applications of classical approximation theory to periodic basis function networks and computational harmonic analysis ⋮ Optimal approximation of elliptic problems by linear and nonlinear mappings. III: Frames ⋮ Optimal linear randomized methods for linear operators in Hilbert spaces ⋮ Lower bounds for the complexity of Monte Carlo function approximation ⋮ A minimax principle for the optimal error of Monte Carlo methods ⋮ Linear widths of a multivariate function space equipped with a Gaussian measure ⋮ Optimal approximation of elliptic problems by linear and nonlinear mappings. I ⋮ Linear vs. nonlinear algorithms for linear problems ⋮ Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure ⋮ Approximation characteristics for diagonal operators in different computational settings ⋮ Optimal approximation of elliptic problems by linear and nonlinear mappings. II ⋮ The information-based complexity of approximation problem by adaptive Monte Carlo methods ⋮ On nonlinear 𝑛-widths ⋮ Linear average and stochastic \(n\)-widths of Besov embeddings on Lipschitz domains ⋮ Average approximations and moments of measures ⋮ Optimal indirect estimation for linear inverse problems with discretely sampled functional data
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Can adaption help on the average?
- Continuous selections. I
- Orthogonal projections are optimal algorithms
- Average case optimality for linear problems
- Approximation of linear functionals on a Banach space with a Gaussian measure
- Probabilistic setting of information-based complexity
- Linear problems (with extended range) have linear optimal algorithms
- Gaussian measures in Banach spaces
- Estimating the quality of computational algorithms. I
- Estimating the quality of computational algorithms. II
- How powerful is continuous nonlinear information for linear problems?
- Recent developments in information-based complexity
- s-Numbers of operators in Banach spaces
- HILBERT-Zahlen von Operatoren in BANACHräumen
