Complexity of approximation of Lipschitz functions

Sergey Borisovich Gashkov, J. V. Wegner · Moscow University Mathematics Bulletin · 2008

The attainability of the lower bound by order is proved for the complexity of a problem of approximation of Lipschitz functions by diagrams of functional elements in bases consisting of a finite number of Lipschitz functions and a continuum of constants from a bounded set.

Read the paper · More papers on PaperTik