Measures minimizing regularized dispersion

Pronzato, Luc and Zhigljavsky, Anatoly ORCID: https://orcid.org/0000-0003-0630-8279 2019. Measures minimizing regularized dispersion. Journal of Scientific Computing 78 (3) , pp. 1550-1570. 10.1007/s10915-018-0817-4

Full text not available from this repository.

Abstract

We consider a continuous extension of a regularized version of the minimax, or dispersion, criterion widely used in space-filling design for computer experiments and quasi-Monte Carlo methods. We show that the criterion is convex for a certain range of the regularization parameter (depending on space dimension) and give a necessary and sufficient condition characterizing the optimal distribution of design points. Using results from potential theory, we investigate properties of optimal measures. The example of design in the unit ball is considered in details and some analytic results are presented. Using recent results and algorithms from experimental design theory, we show how to construct optimal measures numerically. They are often close to the uniform measure but do not coincide with it. The results suggest that designs minimizing the regularized dispersion for suitable values of the regularization parameter should have good space-filling properties. An algorithm is proposed for the construction of n-point designs.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Publisher:	Springer Verlag
ISSN:	0885-7474
Date of Acceptance:	27 August 2018
Last Modified:	24 Oct 2022 07:43
URI:	https://orca.cardiff.ac.uk/id/eprint/115714

Citation Data

Cited 2 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item