Space-filling Latin hypercube designs for computer experiments
From MaRDI portal
Publication:2443402
DOI10.1007/s11081-010-9129-8zbMath1284.90100OpenAlexW2765767683MaRDI QIDQ2443402
Gijs Rennen, Dick den Hertog, Bart Husslage, van Dam, Edwin R.
Publication date: 7 April 2014
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-010-9129-8
maximinsimulated annealingpacking problemcomputer experimentLatin hypercube designspace-fillingnon-collapsingAudze-Eglaisenhanced stochastic evolutionary algorithm
Optimal statistical designs (62K05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Surrogate‐based methods for black‐box optimization ⋮ 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 ⋮ Designing combined physical and computer experiments to maximize prediction accuracy ⋮ Two general extension algorithms of Latin hypercube sampling ⋮ Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints ⋮ sfd ⋮ Damage-induced buckling characteristics of thermally loaded variable angle tow laminated plates under uncertain environment ⋮ A sequential designing-modeling technique when the input factors are not equally important ⋮ Isovolumetric adaptations to space-filling design of experiments ⋮ Computer experiment designs for accurate prediction ⋮ Optimal designs for Gaussian process models via spectral decomposition ⋮ Efficiently packing unequal disks in a circle ⋮ Epistemic uncertainty-based reliability analysis for engineering system with hybrid evidence and fuzzy variables ⋮ Design of computer experiments: space filling and beyond ⋮ Global sensitivity analysis using complex linear models ⋮ Optimal Latin hypercube designs for the Kullback-Leibler criterion ⋮ One-dimensional nested maximin designs ⋮ Maximin distance designs based on densest packings ⋮ Finding maximin Latin hypercube designs by iterated local search heuristics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exploratory designs for computational experiments
- Approximate solutions of continuous dispersion problems
- Optimum blank design for sheet metal forming based on the interaction of high- and low-fidelity FE models
- The discrete p-dispersion problem
- Two-dimensional minimax Latin hypercube designs
- Die dichteste Packung von 36 Kreisen in einem Quadrat. (On the denest packing of 36 circles in a square)
- Algorithmic construction of optimal symmetric Latin hypercube designs.
- Optimizing color picture tubes by high-cost nonlinear programming
- Packing equal circles in a square: A deterministic global optimization approach
- More optimal packings of equal circles in a square
- An efficient algorithm for constructing optimal design of computer experiments
- A study on algorithms for optimization of Latin hypercubes
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Bounds for Maximin Latin Hypercube Designs
- Maximin Latin Hypercube Designs in Two Dimensions
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Identification of elastic properties of laminates based on experiment design
- Metamodels for computer-based engineering design: Survey and recommendations
