The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs

DOI10.2307/1269153zbMath0825.62652OpenAlexW4244198975MaRDI QIDQ4840422

Ruth K. Meyer, Christopher J. Nachtsheim

Publication date: 28 November 1995

Full work available at URL: https://doi.org/10.2307/1269153

Optimal statistical designs (62K05) Probabilistic methods, stochastic differential equations (65C99)

Related Items

Heuristic optimization of experimental designs. ⋮ Optimal Design of Experiments for Implicit Models ⋮ The mixture design threshold accepting algorithm for generating \(D\)-optimal designs of the mixture models ⋮ Augmenting supersaturated designs with Bayesian \(D\)-optimality ⋮ Computing efficient exact designs of experiments using integer quadratic programming ⋮ Optimal Bayesian design for model discrimination via classification ⋮ Incorporating Minimum Variances into Weighted Optimality Criteria ⋮ Application of genetic algorithms to the construction of exact D-optimal designs ⋮ Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm ⋮ Robustness of classical and optimal designs to missing observations ⋮ Factorial and response surface designs robust to missing observations ⋮ An algorithmic framework for generating optimal two-stratum experimental designs ⋮ Optimal Bayesian design for discriminating between models with intractable likelihoods in epidemiology ⋮ On minimally-supported \(D\)-optimal designs for polynomial regression with log-concave weight function ⋮ D-optimality of non-regular design spaces by using a Bayesian modification and a hybrid method ⋮ Efficient computational algorithm for optimal allocation in regression models ⋮ An efficient algorithm for Elastic I‐optimal design of generalized linear models ⋮ The construction of optimal designs for dose-escalation studies ⋮ Hybrid exact-approximate design approach for sparse functional data ⋮ Fast construction of efficient two-level parallel flats designs ⋮ Accounting for outliers in optimal subsampling methods ⋮ An algorithm for the simultaneous construction ofD-optimal experimental designs ⋮ Bayesian design for minimizing prediction uncertainty in bivariate spatial responses with applications to air quality monitoring ⋮ Effect of choice complexity on design efficiency in conjoint choice experiments ⋮ An approach for finding fully Bayesian optimal designs using normal-based approximations to loss functions ⋮ Adaptive grid semidefinite programming for finding optimal designs ⋮ Efficient computational algorithm for optimal continuous experimental designs ⋮ Bayesian Optimal Design for Ordinary Differential Equation Models With Application in Biological Science ⋮ Obtaining more information from conjoint experiments by best-worst choices ⋮ A comparison of design and model selection methods for supersaturated experiments ⋮ Update formulas for split-plot and block designs ⋮ Bayesian design of experiments for logistic regression to evaluate multiple nuclear forensic algorithms ⋮ Combined algorithm to compute D-optimal designs ⋮ D-optimal design of a monitoring network for parameter estimation of distributed systems ⋮ Some refinements on Fedorov's algorithms for constructing D-optimal designs ⋮ Sparse polynomial chaos expansions via compressed sensing and D-optimal design ⋮ An integrative framework for geometric and hidden projections in three-level fractional factorial designs ⋮ \(D\)-optimal and near \(D\)-optimal \(2^k\) fractional factorial designs of resolution V ⋮ A hybrid elitist Pareto-based coordinate exchange algorithm for constructing multi-criteria optimal experimental designs ⋮ Improving the efficiency of fully Bayesian optimal design of experiments using randomised quasi-Monte Carlo ⋮ Bayesian D-optimal supersaturated designs ⋮ Mixed-level column augmented uniform designs ⋮ Adaptive sequential design for regression on multi-resolution bases ⋮ A comparison of three approaches for constructing robust experimental designs ⋮ Using SeDuMi to find various optimal designs for regression models ⋮ An Optimal Scanning Sensor Activation Policy for Parameter Estimation of Distributed Systems ⋮ Balanced Asymmetrical Nearly Orthogonal Designs for first and second order effect estimation ⋮ \((\mathcal D_t,C)\)-optimal run orders ⋮ Algorithmic construction of optimal block designs for two-colour cDNA microarray experiments using the linear mixed effects model ⋮ Bayesian D-Optimal Design Issues for Binomial Generalized Linear Model Screening Designs ⋮ Exchange algorithms for constructing large spatial designs ⋮ Optimized gauging for tire-rim loading identification ⋮ Multiplicative algorithms for computing optimum designs ⋮ A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs ⋮ Bayesian design of experiments for intractable likelihood models using coupled auxiliary models and multivariate emulation ⋮ NESTING OPTIMAL MAIN EFFECTS PLANS AND OPTIMAL FOLDOVER DESIGNS ⋮ Optimal exact designs of experiments via mixed integer nonlinear programming ⋮ A clustering-based coordinate exchange algorithm for generating G-optimal experimental designs ⋮ Efficient computational algorithms for approximate optimal designs ⋮ A branch-and-bound algorithm for the exact optimal experimental design problem ⋮ Optimal design of multifactor experiments via grid exploration ⋮ Least squares polynomial chaos expansion: a review of sampling strategies ⋮ Constructing definitive screening designs using cyclic generators ⋮ Optimal Off-line Experimentation for Games ⋮ Efficiency of the coordinate-exchange algorithm in constructing exact optimal discrete choice experiments ⋮ Screening designs for model discrimination ⋮ A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments ⋮ Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms