The curse of dimensionality for the class of monotone functions and for the class of convex functions

DOI10.1016/j.jat.2011.02.009zbMath1230.65035arXiv1011.3680OpenAlexW1541034379MaRDI QIDQ2275488

Aicke Hinrichs, Erich Novak, Henryk Woźniakowski

Publication date: 9 August 2011

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.3680

zbMATH Keywords

convex functionscurse of dimensionalitymonotone functionsintegration problemminimal cost computing

Mathematics Subject Classification ID

Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

The curse of dimensionality for numerical integration of smooth functions ⋮ Polynomial tractability for integration in an unweighted function space with absolutely convergent Fourier series ⋮ Approximation of curve-based sleeve functions in high dimensions ⋮ The curse of dimensionality for numerical integration of smooth functions. II ⋮ The difficulty of Monte Carlo approximation of multivariate monotone functions ⋮ Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration

Cites Work

• Unnamed Item
• Unnamed Item
• Tractability of multivariate problems. Volume I: Linear information
• Tractability of multivariate problems. Volume II: Standard information for functionals.
• A geometric inequality and the complexity of computing volume
• Deterministic and stochastic error bounds in numerical analysis
• Integration of monotone functions of several variables
• Quadrature formulas for multivariate convex functions
• Widths and shape-preserving widths of Sobolev-type classes of \(s\)-monotone functions

This page was built for publication: The curse of dimensionality for the class of monotone functions and for the class of convex functions