Liberating the dimension for function approximation: standard information (Q555029)

The paper is devoted to a study of the tractability and complexity of the approximation (and related problems) of functions of infinitely many variables. In contrast to the authors' earlier paper dealing with the same problem for algorithms using linear information [J. Complexity 27, No.~1, 86--110 (2011; Zbl 1208.65024)], now algorithms using standard information are admitted. The emphasis is on questions of polynomial tractability. The main results are upper bounds on the complexity and sufficient conditions for the tractability. For most results, the authors provide both a non-constructive proof under very weak assumptions and a constructive proof under more restrictive conditions.