On the entropy numbers of the mixed smoothness function classes

From MaRDI portal
Publication:526783

DOI10.1016/J.JAT.2017.02.002zbMATH Open1366.41019arXiv1602.08712OpenAlexW2964270625WikidataQ114164933 ScholiaQ114164933MaRDI QIDQ526783FDOQ526783

V. N. Temlyakov

Publication date: 15 May 2017

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Abstract: Behavior of the entropy numbers of classes of multivariate functions with mixed smoothness is studied here. This problem has a long history and some fundamental problems in the area are still open. The main goal of this paper is to develop a new method of proving the upper bounds for the entropy numbers. This method is based on recent developments of nonlinear approximation, in particular, on greedy approximation. This method consists of the following two steps strategy. At the first step we obtain bounds of the best m-term approximations with respect to a dictionary. At the second step we use general inequalities relating the entropy numbers to the best m-term approximations. For the lower bounds we use the volume estimates method, which is a well known powerful method for proving the lower bounds for the entropy numbers. It was used in a number of previous papers.


Full work available at URL: https://arxiv.org/abs/1602.08712





Cites Work


Cited In (18)






This page was built for publication: On the entropy numbers of the mixed smoothness function classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526783)