The curse of dimensionality for the class of monotone functions and for the class of convex functions (Q2275488): Difference between revisions

The authors study the integration problem and the approximation problem, in the \(L^p\) norm with \(p\in [1,\infty]\), for classes of monotone or convex \(d\)-variate bounded functions, here \(d\) is the numbers of variables. By curse of dimensionality, the authors define the minimal cost of computing an \(\varepsilon\)-approximation. The conclusion of the paper is that the curse of dimensionality holds for the \(L^p\)-approximation problem for both classes of monotone functions, respectively of convex functions.