Kolmogorov entropy for classes of convex functions (Q836088)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5600307
Language Label Description Also known as
default for all languages
No label defined
    English
    Kolmogorov entropy for classes of convex functions
    scientific article; zbMATH DE number 5600307

      Statements

      Kolmogorov entropy for classes of convex functions (English)
      0 references
      31 August 2009
      0 references
      Kolmogorov \(\varepsilon\)-entropy of a compact set in the metric space measures its metric massivity and thus replaces its dimension which is usually infinite. The \(\varepsilon\)-entropy of a compact set is the most economic quantity of information that permits a recovery of elements of this set with accuracy \(\varepsilon\). The present article deals with the study of the problem of asymptotic behavior of the \(\varepsilon\)-entropy for uniformly bounded classes of convex functions in \(L_p\) metric. The asymptotic of the Kolmogorov \(\varepsilon\)-entropy for the compact metric space of convex and uniformly bounded functions equipped with \(L_p\) metric is \(\varepsilon^{-1/2}\), \(\varepsilon\rightarrow0_+.\)
      0 references
      Kolmogorov \(\varepsilon\)-entropy
      0 references
      massivity of a set
      0 references
      convex function
      0 references
      \(L_p\) metric
      0 references
      Hamming distance
      0 references
      asymptotic behavior
      0 references
      0 references

      Identifiers

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