Pages that link to "Item:Q1587202"
From MaRDI portal
The following pages link to Algorithmic construction of optimal symmetric Latin hypercube designs. (Q1587202):
Displaying 50 items.
- A differential evolution algorithm with self-adaptive strategy and control parameters based on symmetric Latin hypercube design for unconstrained optimization problems (Q322395) (← links)
- An efficient technique for recovering responses of parameterized structural dynamic problems (Q362965) (← links)
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints (Q367165) (← links)
- Nested maximin Latin hypercube designs (Q381446) (← links)
- On second order orthogonal Latin hypercube designs (Q511118) (← links)
- Nearly column-orthogonal designs based on leave-one-out good lattice point sets (Q514180) (← links)
- A novel efficient method for real-time computation of parameterized dynamic equations with large-scale dimension (Q555678) (← links)
- Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions (Q614061) (← links)
- A method for simulation based optimization using radial basis functions (Q622606) (← links)
- Structural optimization by wavelet transforms and neural networks (Q622933) (← links)
- Surrogate-enhanced simulation of aircraft in trimmed state (Q695818) (← links)
- Nash game based efficient global optimization for large-scale design problems (Q721150) (← links)
- A class of space-filling designs and their projection properties (Q722673) (← links)
- SOP: parallel surrogate global optimization with Pareto center selection for computationally expensive single objective problems (Q727388) (← links)
- SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications (Q743971) (← links)
- Optimizing Latin hypercube designs by particle swarm (Q746308) (← links)
- Filter-based stochastic algorithm for global optimization (Q785632) (← links)
- Improved strategies for radial basis function methods for global optimization (Q868637) (← links)
- Parallel radial basis function methods for the global optimization of expensive functions (Q881510) (← links)
- Orthogonal-column Latin hypercube designs with small samples (Q961256) (← links)
- Finding maximin Latin hypercube designs by iterated local search heuristics (Q1014951) (← links)
- An adaptive framework for costly black-box global optimization based on radial basis function interpolation (Q1753131) (← links)
- A critical appraisal of design of experiments for uncertainty quantification (Q1787391) (← links)
- Optimal Latin hypercube designs for the Kullback-Leibler criterion (Q2006878) (← links)
- Comparing and generating Latin hypercube designs in kriging models (Q2006879) (← links)
- Maximin distance designs based on densest packings (Q2044761) (← links)
- Sliced symmetrical Latin hypercube designs (Q2059455) (← links)
- Asymptotically optimal maximin distance Latin hypercube designs (Q2124784) (← links)
- Integrating \(\varepsilon \)-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems (Q2124811) (← links)
- A surrogate-based cooperative optimization framework for computationally expensive black-box problems (Q2218881) (← links)
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments (Q2309986) (← links)
- Least squares polynomial chaos expansion: a review of sampling strategies (Q2310855) (← links)
- A quasi-multistart framework for global optimization of expensive functions using response surface models (Q2393073) (← links)
- A stochastic adaptive radial basis function algorithm for costly black-box optimization (Q2422135) (← links)
- Space-filling Latin hypercube designs for computer experiments (Q2443402) (← links)
- An efficient algorithm for constructing optimal design of computer experiments (Q2485987) (← links)
- A study on algorithms for optimization of Latin hypercubes (Q2498770) (← links)
- Optimal Noncollapsing Space-Filling Designs for Irregular Experimental Regions (Q3391185) (← links)
- An algorithm for fast optimal Latin hypercube design of experiments (Q3567270) (← links)
- Calibrating a Stochastic, Agent-Based Model Using Quantile-Based Emulation (Q4611533) (← links)
- An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design (Q5059304) (← links)
- Kriging-based unconstrained global optimization through multi-point sampling (Q5059380) (← links)
- A novel extension algorithm for optimized Latin hypercube sampling (Q5106950) (← links)
- (Q5159421) (← links)
- Space-filling orthogonal arrays of strength two (Q5220794) (← links)
- Surrogate‐based methods for black‐box optimization (Q5278217) (← links)
- Construction of nearly orthogonal Latin hypercube designs (Q5919986) (← links)
- Service expansion for chained business facilities under congestion and market competition (Q6164376) (← links)
- Isovolumetric adaptations to space-filling design of experiments (Q6173800) (← links)
- Construction of maximin \(L_1\)-distance Latin hypercube designs (Q6184935) (← links)
