The curse of dimensionality for the class of monotone functions and for the class of convex functions (Q2275488)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The curse of dimensionality for the class of monotone functions and for the class of convex functions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The curse of dimensionality for the class of monotone functions and for the class of convex functions |
scientific article |
Statements
The curse of dimensionality for the class of monotone functions and for the class of convex functions (English)
0 references
9 August 2011
0 references
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.
0 references
integration problem
0 references
monotone functions
0 references
convex functions
0 references
minimal cost computing
0 references
curse of dimensionality
0 references
0 references
0 references
0.8721834
0 references
0.86150885
0 references
0.86131495
0 references
0 references
0.8594732
0 references
0.85884964
0 references
0.8578987
0 references
0.85703933
0 references