Isovolumetric adaptations to space-filling design of experiments
From MaRDI portal
Publication:6173800
DOI10.1007/s11081-022-09731-6OpenAlexW4383997971MaRDI QIDQ6173800
Koushyar Komeilizadeh, Fabian M. E. Duddeck, Arne Kaps
Publication date: 13 July 2023
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-022-09731-6
design of experimentsMonte Carlo methodscurse of dimensionalityspace-filling designssampling-based optimization(optimal) Latin hypercube
Theory of data (68Pxx) Design of statistical experiments (62Kxx) Sequential statistical methods (62Lxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing Sobol Sequences with Better Two-Dimensional Projections
- Exploratory designs for computational experiments
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- Algorithmic construction of optimal symmetric Latin hypercube designs.
- Evolutionary multi-objective multi-architecture design space exploration methodology
- A critical appraisal of design of experiments for uncertainty quantification
- Bayesian optimization using deep Gaussian processes with applications to aerospace system design
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
- Relaxing high-dimensional constraints in the direct solution space method for early phase development
- Robust design optimization for improving automotive shift quality
- High fidelity multidisciplinary design optimization of a wing using the interaction of low and high fidelity models
- Comparison of Sobol' sequences in financial applications
- Space-filling Latin hypercube designs for computer experiments
- An efficient algorithm for constructing optimal design of computer experiments
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Algorithm 659
- A generalized discrepancy and quadrature error bound
- Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
- A novel extension algorithm for optimized Latin hypercube sampling
- Remark on algorithm 659
This page was built for publication: Isovolumetric adaptations to space-filling design of experiments