Skip to Main content Skip to Navigation
Journal articles

Measures minimizing regularized dispersion

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.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01864088
Contributor : Luc Pronzato <>
Submitted on : Wednesday, August 29, 2018 - 1:46:15 PM
Last modification on : Thursday, March 5, 2020 - 12:20:25 PM
Document(s) archivé(s) le : Friday, November 30, 2018 - 4:00:17 PM

File

dispersion-opt-measures_Spring...
Files produced by the author(s)

Identifiers

Collections

Citation

Luc Pronzato, Anatoly Zhigljavsky. Measures minimizing regularized dispersion. Journal of Scientific Computing, Springer Verlag, 2019, 78 (3), pp.1550-1570. ⟨10.1007/s10915-018-0817-4⟩. ⟨hal-01864088⟩

Share

Metrics

Record views

364

Files downloads

103