An efficient algorithm for constructing optimal design of computer experiments
From MaRDI portal
Publication:2485987
Recommendations
- Combined algorithm to compute D-optimal designs
- A new approach to the construction of optimal designs
- Efficient algorithms for constructing D- and I-optimal exact designs for linear and non-linear models in mixture experiments
- Heuristic optimization of experimental designs.
- Construction of Optimal Block Designs by Computer
Cites work
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A generalized discrepancy and quadrature error bound
- A Mathematical Theory of Communication
- Algorithmic construction of optimal symmetric Latin hypercube designs.
- Centered L₂-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs
- Columnwise-Pairwise Algorithms with Applications to the Construction of Supersaturated Designs
- Exploratory designs for computational experiments
- scientific article; zbMATH DE number 1209388 (Why is no real title available?)
- scientific article; zbMATH DE number 1103088 (Why is no real title available?)
- scientific article; zbMATH DE number 775913 (Why is no real title available?)
- Optimal Latin-hypercube designs for computer experiments
- Orthogonal Array-Based Latin Hypercubes
- Orthogonal arrays. Theory and applications
- Uniform Design: Theory and Application
Cited in
(79)- Finding maximin Latin hypercube designs by iterated local search heuristics
- An adjustment algorithm for optimal run orders in design of experiments
- Population parametrization of costly black box models using iterations between SAEM algorithm and Kriging
- An algorithmic framework for generating optimal two-stratum experimental designs
- Efficient computational algorithm for optimal continuous experimental designs
- Uncertainty quantification in multiscale simulation of woven fiber composites
- 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
- Optimal design of multifactor experiments via grid exploration
- Uniform projection nested Latin hypercube designs
- Asymptotically optimal maximin distance Latin hypercube designs
- Kriging-assisted teaching-learning-based optimization (KTLBO) to solve computationally expensive constrained problems
- 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
- Construction of uniform designs without replications
- High dimensional kriging metamodelling utilising gradient information
- Data-driven stochastic inversion via functional quantization
- 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
- Efficiency of the coordinate-exchange algorithm in constructing exact optimal discrete choice experiments
- Efficient construction of Bayes optimal designs for stochastic process models
- Space-filling Latin hypercube designs for computer experiments
- Approximation of IMSE-optimal designs via quadrature rules and spectral decomposition
- General orthogonal designs for parameter estimation of ANOVA models under weighted sum-to-zero constraints
- Tuning an Algorithm Using Design of Experiments
- A combinatorial search technique for constructing optimal designs for biased models
- A framework for controlling sources of inaccuracy in Gaussian process emulation of deterministic computer experiments
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- An Efficient Algorithm for Optimal Design of Diagnostics
- scientific article; zbMATH DE number 4166392 (Why is no real title available?)
- An algorithm for fast optimal Latin hypercube design of experiments
- 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
- An Adjustment Algorithm for the Construction of Exact D-Optimum Experimental Designs
- A spectral approach for the design of experiments: design, analysis and algorithms
- scientific article; zbMATH DE number 1419976 (Why is no real title available?)
- The first approximation algorithm for the maximin Latin hypercube design problem
- 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
- Uncertainty quantification of store-separation simulation due to ejector modeling using a Monte Carlo approach with kriging model
- A novel extension algorithm for optimized Latin hypercube sampling
- Hyperparameter optimization via sequential uniform designs
- A standardized distance-based index to assess the quality of space-filling designs
- Space-filling orthogonal arrays of strength two
- A clustering-based coordinate exchange algorithm for generating G-optimal experimental designs
- Maximum projection designs for computer experiments
- scientific article; zbMATH DE number 5274768 (Why is no real title available?)
- Estimation of the derivative-based global sensitivity measures using a Gaussian process metamodel
- An algorithm for the simultaneous construction ofD-optimal experimental designs
- Non‐intrusive reduced‐order modeling using convolutional autoencoders
- Surrogate-based optimization with adaptive parallel infill strategy enhanced by inaccurate multi-objective search
- 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
- A sequential optimal Latin hypercube design method using an efficient recursive permutation evolution algorithm
- An adaptive sampling algorithm for reduced-order models using isomap
- Efficient prediction designs for random fields
- Space-filling designs with a Dirichlet distribution for mixture experiments
- An integer programming algorithm for constructing maximin distance designs from good lattice point sets
- Controlling Sources of Inaccuracy in Stochastic Kriging
- An Information Geometry Approach to Robustness Analysis for the Uncertainty Quantification of Computer Codes
- Modification of the Maximin and ϕp (Phi) Criteria to Achieve Statistically Uniform Distribution of Sampling Points
- Design of computer experiments: space filling and beyond
- Lower bounds of projection weighted symmetric discrepancy on uniform designs
- Theory and application of absolute discrepancy in experimental designs
- Musings on constructions of optimal Latin hypercube designs with flexible sizes
- Optimizing Latin hypercube designs by particle swarm
- Construction and efficient implementation of adaptive objective-based designs of experiments
- Statistical volume element method for predicting microstructure-constitutive property relations
This page was built for publication: An efficient algorithm for constructing optimal design of computer experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485987)
