Orthogonal-maximin Latin hypercube designs
From MaRDI portal
Recommendations
- A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs
- On maximin distance and nearly orthogonal Latin hypercube designs
- Optimal Latin-hypercube designs for computer experiments
- Bounds for maximin Latin hypercube designs
- Optimal maximin \(L_2\)-distance Latin hypercube designs
Cited in
(73)- Two-dimensional minimax Latin hypercube designs
- Finding maximin Latin hypercube designs by iterated local search heuristics
- Bounding rare event probabilities in computer experiments
- Novel two-stage method for low-order polynomial model
- Uniform projection designs
- A critical appraisal of design of experiments for uncertainty quantification
- Using integer programming techniques for the solution of an experimental design problem
- Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
- Maximin distance designs based on densest packings
- Connecting U-type designs before and after level permutations and expansions
- Representative points for distribution recovering
- Asymptotically optimal maximin distance Latin hypercube designs
- Topology optimization using material-field series expansion and Kriging-based algorithm: an effective non-gradient method
- On maximin distance and nearly orthogonal Latin hypercube designs
- Column-orthogonal nearly strong orthogonal arrays
- Optimal maximin \(L_2\)-distance Latin hypercube designs
- On design and analysis of funnel testing experiments in webpage optimization
- Global fitting of the response surface via estimating multiple contours of a simulator
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
- Least squares polynomial chaos expansion: a review of sampling strategies
- A study on algorithms for optimization of Latin hypercubes
- Bayesian inference using Gaussian process surrogates in cancer modeling
- Reprint of: Bayesian inference using Gaussian process surrogates in cancer modeling
- On sampling methods for costly multi-objective black-box optimization
- Bounds for maximin Latin hypercube designs
- Generating a maximally spaced set of bins to fill for high-dimensional space-filling Latin hypercube sampling
- An algorithm for fast optimal Latin hypercube design of experiments
- Optimal orthogonal-array-based latin hypercubes
- Nested maximin Latin hypercube designs
- scientific article; zbMATH DE number 1203748 (Why is no real title available?)
- Some new classes of orthogonal Latin hypercube designs
- Accurate emulators for large-scale computer experiments
- Convergence guarantees for Gaussian process means with misspecified likelihoods and smoothness
- An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
- LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model
- Designing a computer experiment that involves switches
- Algorithms for generating maximin Latin hypercube and orthogonal designs
- Maximum expected entropy transformed Latin hypercube designs
- A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs
- Doubly Coupled Designs for Computer Experiments With Both Qualitative and Quantitative Factors
- Exploratory ensemble designs for environmental models using k‐extended Latin Hypercubes
- A new rotation method for constructing orthogonal Latin hypercube designs
- On the maximin distance properties of orthogonal designs via the rotation
- Construction of maximin L₁-distance Latin hypercube designs
- Topology optimization design of deformable flexible thermoelectric devices for voltage enhancement
- A dimensionality reduction and layout optimization scheme for grid-stiffened structures
- Latin hypercube sampling with multidimensional uniformity
- Construction of high-dimensional high-separation distance designs
- An integer programming algorithm for constructing maximin distance designs from good lattice point sets
- Column expanded Latin hypercube designs
- Design for Sequential Follow-Up Experiments in Computer Emulations
- Strong orthogonal Latin hypercubes for computer experiments
- A Subsampling Method for Regression Problems Based on Minimum Energy Criterion
- Efficient kriging using interleaved lattice-based designs with low fill and high separation distance properties
- A Projection Space-Filling Criterion and Related Optimality Results
- A construction method for maximin \(L_1\)-distance Latin hypercube designs
- Searching for optimal Latin hypercube designs by a local greedy strategy
- Grouped orthogonal arrays for computer experiments with grouped inputs
- A new class of orthogonal designs with good low dimensional space-filling properties
- Robust Design for Order-of-Addition Experiments
- Enhanced branching Latin hypercube design and its application in automatic algorithm configuration
- A new class of asymptotic maximin distance Latin hypercube designs
- Construction of designs with space-filling and orthogonal property
- The optimization of space-filling and orthogonality for Latin hypercube design using a local search-based NSGA-II
- Topology optimization of two-dimensional magnetorheological elastomer phononic crystal plate with tunable bandgap considering a specified target frequency
- Systematic optimization methods for uniform designs under wrap-around L₂-discrepancy
- Construction of Asymmetric Nested Orthogonal Arrays
- Musings on constructions of optimal Latin hypercube designs with flexible sizes
- Optimizing Latin hypercube designs by particle swarm
- Orthogonal-column Latin hypercube designs with small samples
- A new and flexible method for constructing designs for computer experiments
- Construction of orthogonal Latin hypercube designs with flexible run sizes
- Orthogonal Latin hypercube designs from generalized orthogonal designs
This page was built for publication: Orthogonal-maximin Latin hypercube designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498633)
