Exploratory designs for computational experiments
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3359503 (Why is no real title available?)
- scientific article; zbMATH DE number 3090609 (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
- An Analysis for Unreplicated Fractional Factorials
- Bayesian Design and Analysis of Computer Experiments: Use of Derivatives in Surface Prediction
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Generalized Simulated Annealing for Function Optimization
Cited in
(only showing first 100 items - show all)- Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
- scientific article; zbMATH DE number 7370640 (Why is no real title available?)
- A fast and calibrated computer model emulator: an empirical Bayes approach
- Probabilistic uncertainty and sensitivity analysis of a vibratory-based actuation mechanism for a bio-inspired flapping-wing system
- Sliced symmetrical Latin hypercube designs
- Maximin distance designs based on densest packings
- Measures of uniformity in experimental designs: a selective overview
- Data-driven stochastic inversion via functional quantization
- TRANSFORM-ANN for online optimization of complex industrial processes: casting process as case study
- Estimating percentiles in computer experiments: a comparison of sequential-adaptive designs and fixed designs
- The first approximation algorithm for the maximin Latin hypercube design problem
- Comparing and generating Latin hypercube designs in kriging models
- Parameter estimation and sensitivity analysis in an agent-based model of \textit{Leishmania major} infection
- Coffee-house designs
- Extremal measures maximizing functionals based on simplicial volumes
- Interval optimization for structural dynamic responses of an artillery system under uncertainty
- Bayesian Subset Simulation
- Space-filling experimental designs for constrained design spaces
- MILP models for the selection of a small set of well-distributed points
- Dynamic simulation metamodeling using Mars: a case of radar simulation
- Effective model calibration via sensible variable identification and adjustment with application to composite fuselage simulation
- A sparse polynomial surrogate model for phononic crystals with uncertain parameters
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
- Kernel approximation: from regression to interpolation
- A Clustered Gaussian Process Model for Computer Experiments
- Adaptive design for Gaussian process regression under censoring
- Batch-sequential design and heteroskedastic surrogate modeling for delta smelt conservation
- Bounding rare event probabilities in computer experiments
- Diagnostics-driven nonstationary emulators using kernel mixtures
- Central limit theorems for four new types of \(U\)-designs
- Construction of uniform projection designs via level permutation and expansion
- Multi-objective optimization of an injection molding process
- Bayesian integrative analysis for multi-fidelity computer experiments
- Exploratory ensemble designs for environmental models using k‐extended Latin Hypercubes
- Space-filling designs based on the Kullback-Leibler divergence
- Building some bridges among various experimental designs
- An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
- Variance-based adaptive sequential sampling for polynomial chaos expansion
- Determining \textit{a priori} a RANS model's applicable range via global epistemic uncertainty quantification
- On sampling methods for costly multi-objective black-box optimization
- Efficient evaluation of reliability-oriented sensitivity indices
- Connecting U-type designs before and after level permutations and expansions
- Model-robust subdata selection for big data
- On efficient design of pilot experiment for generalized linear models
- On the interface between nested designs and the multi-step interpolator
- Uniform projection nested Latin hypercube designs
- Incremental modeling of a new high-order polynomial surrogate model
- Engineering design applications of surrogate-assisted optimization techniques
- Flexible sliced designs for computer experiments
- Computer experiments with functional inputs and scalar outputs by a norm-based approach
- Development of an adaptive infill criterion for constrained multi-objective asynchronous surrogate-based optimization
- Computer experiment designs for accurate prediction
- A critical appraisal of design of experiments for uncertainty quantification
- Construction of computer experiment designs using marked point processes
- Input parameter and thermal load representation uncertainties effects on the buckling and dynamic characteristics of cylindrical tubes
- Variational inference with vine copulas: an efficient approach for Bayesian computer model calibration
- A discontinuous derivative-free optimization framework for multi-enterprise supply chain
- Measures minimizing regularized dispersion
- Space-filling Latin hypercube designs based on randomization restrictions in factorial experiments
- Gaussian processes for history-matching: application to an unconventional gas reservoir
- Fast prediction of deterministic functions using sparse grid experimental designs
- An algorithm for fast optimal Latin hypercube design of experiments
- Optimal experimental design and some related control problems
- Gaussian process emulation for second-order Monte Carlo simulations
- Surrogate‐based methods for black‐box optimization
- Batch sequential designs for computer experiments
- Construction of uniform designs without replications
- Construction of maximin \(L_1\)-distance Latin hypercube designs
- Projection array based designs for computer experiments
- An efficient surrogate model for emulation and physics extraction of large eddy simulations
- Space-filling Latin hypercube designs for computer experiments
- Design and Analysis of Computational Experiments: Overview
- Space-filling fractional factorial designs
- Optimal maximin \(L_2\)-distance Latin hypercube designs
- Simplex based space filling designs
- A novel efficient method for real-time computation of parameterized dynamic equations with large-scale dimension
- Variable-fidelity modeling of structural analysis of assemblies
- One-dimensional nested maximin designs
- Optimal Noncollapsing Space-Filling Designs for Irregular Experimental Regions
- Optimal exact experimental designs with correlated errors through a simulated annealing algorithm
- A polynomial chaos expansion approach for nonlinear dynamic systems with interval uncertainty
- Finding optimal points for expensive functions using adaptive RBF-based surrogate model via uncertainty quantification
- Constructing optimal projection designs
- Sliced Latin Hypercube Designs
- Optimal Latin hypercube designs for the Kullback-Leibler criterion
- Approximate solutions of continuous dispersion problems
- Analysis methods for computer experiments: how to assess and what counts?
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints
- On maximin distance and nearly orthogonal Latin hypercube designs
- A new and flexible method for constructing designs for computer experiments
- Optimizing Latin hypercube designs by particle swarm
- Orthogonal-column Latin hypercube designs with small samples
- Nested maximin Latin hypercube designs
- Optimal design of interference fit assemblies subjected to fatigue loads: a sequential approximate multi-objective optimization approach
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- An efficient algorithm for constructing optimal design of computer experiments
- Construction of orthogonal Latin hypercube designs with flexible run sizes
- Constrained minimum energy designs
- Privacy sets for constrained space-filling
- Expected improvement based infill sampling for global robust optimization of constrained problems
This page was built for publication: Exploratory designs for computational experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q150636)
