The Curse of Dimensionality for Monotone and Convex Functions of Many Variables

preprint2010arXivOpen access

Abstract

We study the integration and approximation problems for monotone and convex bounded functions that depend on dd variables, where dd 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 dd) function values to achieve an error εε.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.