Algorithmic construction of optimal symmetric Latin hypercube designs.

DOI10.1016/S0378-3758(00)00105-1zbMath1109.62329OpenAlexW2070425636MaRDI QIDQ1587202

William Li, Kenny Q. Ye, Agus Sudjianto

Publication date: 20 November 2000

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-3758(00)00105-1

zbMATH Keywords

Maximin designComputer experimentMaximum entropy design

Mathematics Subject Classification ID

Related Items (50)

Surrogate‐based methods for black‐box optimization ⋮ Asymptotically optimal maximin distance Latin hypercube designs ⋮ Integrating \(\varepsilon \)-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems ⋮ An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design ⋮ Kriging-based unconstrained global optimization through multi-point sampling ⋮ A differential evolution algorithm with self-adaptive strategy and control parameters based on symmetric Latin hypercube design for unconstrained optimization problems ⋮ A quasi-multistart framework for global optimization of expensive functions using response surface models ⋮ Improved strategies for radial basis function methods for global optimization ⋮ An efficient technique for recovering responses of parameterized structural dynamic problems ⋮ Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints ⋮ Nested maximin Latin hypercube designs ⋮ Parallel radial basis function methods for the global optimization of expensive functions ⋮ Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions ⋮ A stochastic adaptive radial basis function algorithm for costly black-box optimization ⋮ A method for simulation based optimization using radial basis functions ⋮ A novel extension algorithm for optimized Latin hypercube sampling ⋮ Structural optimization by wavelet transforms and neural networks ⋮ Service expansion for chained business facilities under congestion and market competition ⋮ Isovolumetric adaptations to space-filling design of experiments ⋮ Construction of maximin \(L_1\)-distance Latin hypercube designs ⋮ Calibrating a Stochastic, Agent-Based Model Using Quantile-Based Emulation ⋮ Space-filling Latin hypercube designs for computer experiments ⋮ A surrogate-based cooperative optimization framework for computationally expensive black-box problems ⋮ On second order orthogonal Latin hypercube designs ⋮ Nearly column-orthogonal designs based on leave-one-out good lattice point sets ⋮ An algorithm for fast optimal Latin hypercube design of experiments ⋮ An adaptive framework for costly black-box global optimization based on radial basis function interpolation ⋮ Orthogonal-column Latin hypercube designs with small samples ⋮ Surrogate-enhanced simulation of aircraft in trimmed state ⋮ Optimal Latin hypercube designs for the Kullback-Leibler criterion ⋮ Comparing and generating Latin hypercube designs in kriging models ⋮ An efficient algorithm for constructing optimal design of computer experiments ⋮ A novel efficient method for real-time computation of parameterized dynamic equations with large-scale dimension ⋮ A study on algorithms for optimization of Latin hypercubes ⋮ Nash game based efficient global optimization for large-scale design problems ⋮ A class of space-filling designs and their projection properties ⋮ A critical appraisal of design of experiments for uncertainty quantification ⋮ SOP: parallel surrogate global optimization with Pareto center selection for computationally expensive single objective problems ⋮ Maximin distance designs based on densest packings ⋮ SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications ⋮ Construction of nearly orthogonal Latin hypercube designs ⋮ Optimizing Latin hypercube designs by particle swarm ⋮ Finding maximin Latin hypercube designs by iterated local search heuristics ⋮ Space-filling orthogonal arrays of strength two ⋮ Optimal Noncollapsing Space-Filling Designs for Irregular Experimental Regions ⋮ Sliced symmetrical Latin hypercube designs ⋮ Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments ⋮ Least squares polynomial chaos expansion: a review of sampling strategies ⋮ Filter-based stochastic algorithm for global optimization ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exploratory designs for computational experiments
• Optimal Latin-hypercube designs for computer experiments
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Orthogonal Array-Based Latin Hypercubes
• Columnwise-Pairwise Algorithms with Applications to the Construction of Supersaturated Designs
• Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments

This page was built for publication: Algorithmic construction of optimal symmetric Latin hypercube designs.