Algorithmic construction of optimal symmetric Latin hypercube designs.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1209388 (Why is no real title available?)
- scientific article; zbMATH DE number 735224 (Why is no real title available?)
- scientific article; zbMATH DE number 775913 (Why is no real title available?)
- scientific article; zbMATH DE number 845705 (Why is no real title available?)
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Columnwise-Pairwise Algorithms with Applications to the Construction of Supersaturated Designs
- Exploratory designs for computational experiments
- Optimal Latin-hypercube designs for computer experiments
- Orthogonal Array-Based Latin Hypercubes
- Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
Cited in
(56)- An algorithm for fast optimal Latin hypercube design of experiments
- Surrogate-enhanced simulation of aircraft in trimmed state
- A surrogate-based cooperative optimization framework for computationally expensive black-box problems
- Kriging-based unconstrained global optimization through multi-point sampling
- An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
- Optimal Latin hypercube designs for the Kullback-Leibler criterion
- A novel efficient method for real-time computation of parameterized dynamic equations with large-scale dimension
- Space-filling orthogonal arrays of strength two
- A study on algorithms for optimization of Latin hypercubes
- Parallel radial basis function methods for the global optimization of expensive functions
- Comparing emulation methods for a high-resolution storm surge model
- Space-filling Latin hypercube designs for computer experiments
- Nash game based efficient global optimization for large-scale design problems
- A class of space-filling designs and their projection properties
- Service expansion for chained business facilities under congestion and market competition
- An integer programming algorithm for constructing maximin distance designs from good lattice point sets
- SOP: parallel surrogate global optimization with Pareto center selection for computationally expensive single objective problems
- Isovolumetric adaptations to space-filling design of experiments
- An efficient algorithm for constructing optimal design of computer experiments
- Construction of optimal symmetrical Latin hypercube
- Construction of maximin \(L_1\)-distance Latin hypercube designs
- scientific article; zbMATH DE number 7415092 (Why is no real title available?)
- SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications
- Optimizing Latin hypercube designs by particle swarm
- Controlling Sources of Inaccuracy in Stochastic Kriging
- A differential evolution algorithm with self-adaptive strategy and control parameters based on symmetric Latin hypercube design for unconstrained optimization problems
- Maximin distance designs based on densest packings
- Orthogonal-column Latin hypercube designs with small samples
- Structural optimization by wavelet transforms and neural networks
- Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions
- A method for simulation based optimization using radial basis functions
- Calibrating a stochastic, agent-based model using quantile-based emulation
- Improved strategies for radial basis function methods for global optimization
- Optimal Noncollapsing Space-Filling Designs for Irregular Experimental Regions
- Asymptotically optimal maximin distance Latin hypercube designs
- Modification of the Maximin and ϕp (Phi) Criteria to Achieve Statistically Uniform Distribution of Sampling Points
- Least squares polynomial chaos expansion: a review of sampling strategies
- Sliced symmetrical Latin hypercube designs
- On second order orthogonal Latin hypercube designs
- Filter-based stochastic algorithm for global optimization
- An efficient technique for recovering responses of parameterized structural dynamic problems
- An adaptive framework for costly black-box global optimization based on radial basis function interpolation
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints
- A novel extension algorithm for optimized Latin hypercube sampling
- Construction of nearly orthogonal Latin hypercube designs
- Nested maximin Latin hypercube designs
- Integrating -dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems
- Surrogate‐based methods for black‐box optimization
- Nearly column-orthogonal designs based on leave-one-out good lattice point sets
- A stochastic adaptive radial basis function algorithm for costly black-box optimization
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
- Comparing and generating Latin hypercube designs in kriging models
- Finding maximin Latin hypercube designs by iterated local search heuristics
- A critical appraisal of design of experiments for uncertainty quantification
- A novel doubling-tripling-threshold accepting hybrid algorithm for constructing asymmetric space-filling designs
- A quasi-multistart framework for global optimization of expensive functions using response surface models
This page was built for publication: Algorithmic construction of optimal symmetric Latin hypercube designs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587202)
