An efficient algorithm for constructing optimal design of computer experiments

DOI10.1016/j.jspi.2004.02.014zbMath1066.62075OpenAlexW1981270896MaRDI QIDQ2485987

Agus Sudjianto, Ruichen Jin, Wei Chen

Publication date: 5 August 2005

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

Full work available at URL: https://doi.org/10.1016/j.jspi.2004.02.014

zbMATH Keywords

Computer experimentsStochastic evolutionary algorithm

Mathematics Subject Classification ID

Related Items (50)

Asymptotically optimal maximin distance Latin hypercube designs ⋮ Kriging-assisted teaching-learning-based optimization (KTLBO) to solve computationally expensive constrained problems ⋮ A Framework for Controlling Sources of Inaccuracy in Gaussian Process Emulation of Deterministic Computer Experiments ⋮ Efficient global optimization for high-dimensional constrained problems by using the Kriging models combined with the partial least squares method ⋮ Space-filling experimental designs for constrained design spaces ⋮ Response surface optimization for a nonlinearly constrained irregular experimental design space ⋮ An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design ⋮ A fast optimal Latin hypercube design method using an improved translational propagation algorithm ⋮ Population parametrization of costly black box models using iterations between SAEM algorithm and Kriging ⋮ Uncertainty Quantification of Store-Separation Simulation Due to Ejector Modeling Using a Monte Carlo Approach with Kriging Model ⋮ Subset selection from large datasets for kriging modeling ⋮ Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions ⋮ A new sparse grid based method for uncertainty propagation ⋮ Nested maximin Latin hypercube designs ⋮ Concurrent treatment of parametric uncertainty and metamodeling uncertainty in robust design ⋮ Non‐intrusive reduced‐order modeling using convolutional autoencoders ⋮ Surrogate-based optimization with adaptive parallel infill strategy enhanced by inaccurate multi-objective search ⋮ A novel extension algorithm for optimized Latin hypercube sampling ⋮ Data-driven and physics-based modelling of process behaviour and deposit geometry for friction surfacing ⋮ Optimal design of experiments for hypothesis testing on ordered treatments via intersection-union tests ⋮ A new rotation method for constructing orthogonal Latin hypercube designs ⋮ Sequentially weighted uniform designs ⋮ Isovolumetric adaptations to space-filling design of experiments ⋮ A latent variable approach for non-hierarchical multi-fidelity adaptive sampling ⋮ Space-filling Latin hypercube designs for computer experiments ⋮ A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization ⋮ A variable-fidelity hybrid surrogate approach for quantifying uncertainties in the nonlinear response of braided composites ⋮ Optimal space-filling design for symmetrical global sensitivity analysis of complex black-box models ⋮ Uncertainty quantification in multiscale simulation of woven fiber composites ⋮ An algorithm for fast optimal Latin hypercube design of experiments ⋮ A standardized distance-based index to assess the quality of space-filling designs ⋮ Construction of uniform designs without replications ⋮ Design of computer experiments: space filling and beyond ⋮ Optimal Latin hypercube designs for the Kullback-Leibler criterion ⋮ Modelling of a thermomechanically coupled forming process based on functional outputs from a finite element analysis and from experimental measurements ⋮ Estimation of the Derivative-Based Global Sensitivity Measures Using a Gaussian Process Metamodel ⋮ Unnamed Item ⋮ Statistical volume element method for predicting microstructure-constitutive property relations ⋮ High dimensional kriging metamodelling utilising gradient information ⋮ Optimizing Latin hypercube designs by particle swarm ⋮ The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem ⋮ Finding maximin Latin hypercube designs by iterated local search heuristics ⋮ Data-driven stochastic inversion via functional quantization ⋮ Approximation of IMSE-optimal Designs via Quadrature Rules and Spectral Decomposition ⋮ Space-filling orthogonal arrays of strength two ⋮ A framework for data-driven analysis of materials under uncertainty: countering the curse of dimensionality ⋮ Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments ⋮ Uniform projection nested Latin hypercube designs ⋮ General orthogonal designs for parameter estimation of ANOVA models under weighted sum-to-zero constraints ⋮ Unnamed Item

Cites Work

• A Mathematical Theory of Communication
• Exploratory designs for computational experiments
• Orthogonal arrays. Theory and applications
• Optimal Latin-hypercube designs for computer experiments
• Algorithmic construction of optimal symmetric Latin hypercube designs.
• Centered $L_2$-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs
• 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
• A generalized discrepancy and quadrature error bound
• Uniform Design: Theory and Application
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient algorithm for constructing optimal design of computer experiments