Pages that link to "Item:Q2485987"
From MaRDI portal
The following pages link to An efficient algorithm for constructing optimal design of computer experiments (Q2485987):
Displaying 50 items.
- Subset selection from large datasets for kriging modeling (Q381304) (← links)
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions (Q381435) (← links)
- A new sparse grid based method for uncertainty propagation (Q381443) (← links)
- Nested maximin Latin hypercube designs (Q381446) (← links)
- Concurrent treatment of parametric uncertainty and metamodeling uncertainty in robust design (Q381914) (← links)
- A standardized distance-based index to assess the quality of space-filling designs (Q518233) (← links)
- Design of computer experiments: space filling and beyond (Q693293) (← links)
- Optimizing Latin hypercube designs by particle swarm (Q746308) (← links)
- Statistical volume element method for predicting microstructure-constitutive property relations (Q995311) (← links)
- Finding maximin Latin hypercube designs by iterated local search heuristics (Q1014951) (← links)
- An adjustment algorithm for optimal run orders in design of experiments (Q1614839) (← links)
- Population parametrization of costly black box models using iterations between SAEM algorithm and Kriging (Q1655366) (← links)
- An algorithmic framework for generating optimal two-stratum experimental designs (Q1658390) (← links)
- Uncertainty quantification in multiscale simulation of woven fiber composites (Q1986218) (← links)
- Optimal Latin hypercube designs for the Kullback-Leibler criterion (Q2006878) (← links)
- Modelling of a thermomechanically coupled forming process based on functional outputs from a finite element analysis and from experimental measurements (Q2006885) (← links)
- Uniform projection nested Latin hypercube designs (Q2065322) (← links)
- Asymptotically optimal maximin distance Latin hypercube designs (Q2124784) (← links)
- Kriging-assisted teaching-learning-based optimization (KTLBO) to solve computationally expensive constrained problems (Q2127063) (← links)
- A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization (Q2218904) (← links)
- A variable-fidelity hybrid surrogate approach for quantifying uncertainties in the nonlinear response of braided composites (Q2237005) (← links)
- Optimal space-filling design for symmetrical global sensitivity analysis of complex black-box models (Q2240294) (← links)
- Construction of uniform designs without replications (Q2252148) (← links)
- High dimensional kriging metamodelling utilising gradient information (Q2290871) (← links)
- Data-driven stochastic inversion via functional quantization (Q2302505) (← links)
- A framework for data-driven analysis of materials under uncertainty: countering the curse of dimensionality (Q2309861) (← links)
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments (Q2309986) (← links)
- Efficiency of the coordinate-exchange algorithm in constructing exact optimal discrete choice experiments (Q2324028) (← links)
- Space-filling Latin hypercube designs for computer experiments (Q2443402) (← links)
- Approximation of IMSE-optimal Designs via Quadrature Rules and Spectral Decomposition (Q2816688) (← links)
- General orthogonal designs for parameter estimation of ANOVA models under weighted sum-to-zero constraints (Q2832621) (← links)
- Tuning an Algorithm Using Design of Experiments (Q3064524) (← links)
- A Framework for Controlling Sources of Inaccuracy in Gaussian Process Emulation of Deterministic Computer Experiments (Q3176230) (← links)
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) (← links)
- An Efficient Algorithm for Optimal Design of Diagnostics (Q3342192) (← links)
- (Q3492682) (← links)
- An algorithm for fast optimal Latin hypercube design of experiments (Q3567270) (← links)
- An Adjustment Algorithm for the Construction of Exact D-Optimum Experimental Designs (Q3821431) (← links)
- (Q4558177) (← links)
- (Q4944576) (← links)
- The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem (Q4969322) (← links)
- Efficient global optimization for high-dimensional constrained problems by using the Kriging models combined with the partial least squares method (Q5058821) (← links)
- Space-filling experimental designs for constrained design spaces (Q5059217) (← links)
- Response surface optimization for a nonlinearly constrained irregular experimental design space (Q5059267) (← links)
- An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design (Q5059304) (← links)
- A fast optimal Latin hypercube design method using an improved translational propagation algorithm (Q5059400) (← links)
- Uncertainty Quantification of Store-Separation Simulation Due to Ejector Modeling Using a Monte Carlo Approach with Kriging Model (Q5077116) (← links)
- A novel extension algorithm for optimized Latin hypercube sampling (Q5106950) (← links)
- (Q5159421) (← links)
- Space-filling orthogonal arrays of strength two (Q5220794) (← links)