Homogeneous algorithms and solvable problems on cones
Spline approximation (41A15) Multidimensional problems (41A63) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Algorithms for approximation of functions (65D15) Numerical integration (65D30) Analysis of algorithms and problem complexity (68Q25)
Optimal recovery and linear approximation problems are standard tasks in numerical analysis. In this paper, best approximations on convex sets are studied. Also, only a limited number of data points (measurements) are allowed. In general a linear approximation method will not be suitable to solve such a problem, but the authors show that a homogeneous algorithm will do this.
- Adaptive approximation for multivariate linear problems with inputs lying in a cone
- On Optimal Algorithms in an Asymptotic Model with Gaussian Measure
- Linearity of algorithms and a result of Ando
- Linear problems (with extended range) have linear optimal algorithms
- Some nonlinear problems are as easy as the approximation problem
- A mathematical introduction to compressive sensing
- A new upper bound for sampling numbers
- A sharp upper bound for sampling numbers in \(L_2\)
- A Universal Median Quasi-Monte Carlo Integration
- Adaptive approximation for multivariate linear problems with inputs lying in a cone
- Adaptive Quasi-Monte Carlo Methods for Cubature
- Are linear algorithms always good for linear problems?
- Bernstein numbers and lower bounds for the Monte Carlo error
- Construction-free median quasi-Monte Carlo rules for function spaces with unspecified smoothness and general weights
- Data assimilation and sampling in Banach spaces
- DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
- Function values are enough for \(L_2\)-approximation
- scientific article; zbMATH DE number 3877692 (Why is no real title available?)
- scientific article; zbMATH DE number 3944477 (Why is no real title available?)
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 3364154 (Why is no real title available?)
- Lattice Rules
- Lattice rules for multivariate approximation in the worst case setting
- Linear problems (with extended range) have linear optimal algorithms
- Linear vs. nonlinear algorithms for linear problems
- Mappings Between Function Spaces
- Near-Optimal Estimation of Linear Functionals with Log-Concave Observation Errors
- Noisy Information and Computational Complexity
- On the optimality of linear methods for operator approximation in convex classes of functions
- On the power of adaption
- Optimal sequential and non-sequential procedures for evaluating a functional
- Optimal solution of nonlinear equations
- Optimization of active algorithms for recovery of monotonic functions from Hölder's class
- Randomized complexity of mean computation and the adaption problem
- Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case
- Randomized complexity of parametric integration and the role of adaption. II: Sobolev spaces
- Reliable adaptive cubature using digital sequences
- s-numbers in information-based complexity
- Solvable integration problems and optimal sample size selection
- Statistical estimation and optimal recovery
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
- Tractability of multivariate problems. Volume I: Linear information
This page was built for publication: Homogeneous algorithms and solvable problems on cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6540037)
