Homogeneous algorithms and solvable problems on cones

Analysis of algorithms and problem complexity (68Q25) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Multidimensional problems (41A63) Spline approximation (41A15) Algorithms for approximation of functions (65D15) Numerical integration (65D30)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A mathematical introduction to compressive sensing
The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
Linear vs. nonlinear algorithms for linear problems
s-numbers in information-based complexity
Tractability of multivariate problems. Volume I: Linear information
Are linear algorithms always good for linear problems?
Linear problems (with extended range) have linear optimal algorithms
Statistical estimation and optimal recovery
Optimization of active algorithms for recovery of monotonic functions from Hölder's class
Data assimilation and sampling in Banach spaces
Solvable integration problems and optimal sample size selection
A new upper bound for sampling numbers
Function values are enough for \(L_2\)-approximation
Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
On the power of adaption
A sharp upper bound for sampling numbers in \(L_2\)
Optimal solution of nonlinear equations
Reliable Adaptive Cubature Using Digital Sequences
Bernstein Numbers and Lower Bounds for the Monte Carlo Error
7. Adaptive approximation for multivariate linear problems with inputs lying in a cone
Optimal sequential and non-sequential procedures for evaluating a functional
DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
Noisy Information and Computational Complexity
Adaptive Quasi-Monte Carlo Methods for Cubature
Lattice Rules
Construction-Free Median Quasi-Monte Carlo Rules for Function Spaces with Unspecified Smoothness and General Weights
On the optimality of linear methods for operator approximation in convex classes of functions
Mappings Between Function Spaces
Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case
A Universal Median Quasi-Monte Carlo Integration
Randomized complexity of parametric integration and the role of adaption. II: Sobolev spaces
Near-Optimal Estimation of Linear Functionals with Log-Concave Observation Errors
Randomized complexity of mean computation and the adaption problem