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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3973370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric inequality and the complexity of computing volume / rank
 
Normal rank
Property / cites work
 
Property / cites work: Widths and shape-preserving widths of Sobolev-type classes of \(s\)-monotone functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadrature formulas for multivariate convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and stochastic error bounds in numerical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of multivariate problems. Volume I: Linear information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of multivariate problems. Volume II: Standard information for functionals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of monotone functions of several variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993279 / rank
 
Normal rank

Latest revision as of 08:45, 4 July 2024

scientific article
Language Label Description Also known as
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
    0 references
    0 references
    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
    0 references
    integration problem
    0 references
    monotone functions
    0 references
    convex functions
    0 references
    minimal cost computing
    0 references
    curse of dimensionality
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references