Optimal Latin hypercube designs for the Kullback-Leibler criterion
type: Item
instance of: scholarly article
title: Optimal Latin hypercube designs for the Kullback-Leibler criterion
zbMATH Open document ID: 1477.62211
author: Yanyan Li
published in: AStA. Advances in Statistical Analysis
publication date: 2020-10-12T00:00:00Z
Mathematics Subject Classification ID: 62K99
Mathematics Subject Classification ID: 62K05
zbMATH DE Number: 7259149
zbMATH Keywords: computer experiments
zbMATH Keywords: space-filling designs
zbMATH Keywords: optimal Latin hypercube designs
zbMATH Keywords: Kullback-Leibler information
MaRDI profile type: Publication
full work available at URL: s10182-010-0145-y
OpenAlex ID: W1992277919
cites work: Q4864284
cites work: Q4367308
cites work: Q5706748
cites work: Finding maximin Latin hypercube designs by iterated local search heuristics
cites work: Space-filling Latin hypercube designs for computer experiments
cites work: An efficient algorithm for constructing optimal design of computer experiments
cites work: A new criterion based on Kullback-Leibler information for space filling designs
cites work: Q4212129
cites work: Sample estimate of the entropy of a random vector
cites work: Computer experiments: a review
cites work: Columnwise-Pairwise Algorithms with Applications to the Construction of Supersaturated Designs
cites work: A study on algorithms for optimization of Latin hypercubes
cites work: Exploratory designs for computational experiments
cites work: Point sets and sequences with small discrepancy
cites work: Optimal Latin-hypercube designs for computer experiments
cites work: Design and analysis of computer experiments. With comments and a rejoinder by the authors
cites work: Algorithmic construction of optimal symmetric Latin hypercube designs.
DOI: 10.1007/S10182-010-0145-Y
description: scientific article; zbMATH DE number 7259149