Construction of Maximin Distance Designs via Level Permutation and Expansion
From MaRDI portal
Publication:4571214
DOI10.5705/ss.202016.0423zbMath1394.62109OpenAlexW2808203674WikidataQ129689989 ScholiaQ129689989MaRDI QIDQ4571214
Publication date: 6 July 2018
Published in: Statistica Sinica (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4cc4667e5e07faca2c1e1764913d5a91aef8d858
orthogonal arrayfractional factorial designgeneralized minimum aberrationcomputer experimentLatin hypercube designspace-filling design
Related Items (17)
On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments ⋮ Construction of column-orthogonal strong orthogonal arrays ⋮ Asymptotically optimal maximin distance Latin hypercube designs ⋮ Construction of uniform projection designs via level permutation and expansion ⋮ Doubly Coupled Designs for Computer Experiments With Both Qualitative and Quantitative Factors ⋮ A unifying implementation of stratum (aka strong) orthogonal arrays ⋮ Modeling and Active Learning for Experiments with Quantitative-Sequence Factors ⋮ On the maximin distance properties of orthogonal designs via the rotation ⋮ Construction of maximin \(L_1\)-distance Latin hypercube designs ⋮ On maximin distance and nearly orthogonal Latin hypercube designs ⋮ Uniform projection designs ⋮ Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs ⋮ Maximin distance designs based on densest packings ⋮ Optimal maximin \(L_2\)-distance Latin hypercube designs ⋮ Connecting U-type designs before and after level permutations and expansions ⋮ EzGP: Easy-to-Interpret Gaussian Process Models for Computer Experiments with Both Quantitative and Qualitative Factors ⋮ A study of orthogonal array-based designs under a broad class of space-filling criteria
This page was built for publication: Construction of Maximin Distance Designs via Level Permutation and Expansion
