arXiv · 1011.3680
The Curse of Dimensionality for Monotone and Convex Functions of Many Variables
Abstract
We study the integration and approximation problems for monotone and convex bounded functions that depend on $d$ variables, where $d$ can be arbitrarily large. We consider the worst case error for algorithms that use finitely many function values. We prove that these problems suffer from the curse of dimensionality. That is, one needs exponentially many (in $d$) function values to achieve an error $ε$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Aicke Hinrichs, Erich Novak, Henryk Woźniakowski. 2010-11-16. The Curse of Dimensionality for Monotone and Convex Functions of Many Variables. https://doi.org/10.1016/j.jat.2011.02.009
Cite the original work for its findings. Save a collection to share your selection of sources.