Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm

DOI10.1007/S11222-014-9467-ZzbMath1342.62132OpenAlexW2070863226MaRDI QIDQ2631342

Peter Goos, Kenneth Sörensen, Daniel Palhazi Cuervo

Publication date: 29 July 2016

Published in: Statistics and Computing (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/10067/1307690151162165141

zbMATH Keywords

metaheuristiciterated local searchoptimal design of experimentsD-optimality criterioncoordinate-exchange algorithm

Mathematics Subject Classification ID

Optimal statistical designs (62K05)

Related Items (7)

An algorithmic framework for generating optimal two-stratum experimental designs ⋮ Optimal Bayesian design for discriminating between models with intractable likelihoods in epidemiology ⋮ Efficient designs for Bayesian networks with sub-tree bounds ⋮ Using SeDuMi to find various optimal designs for regression models ⋮ Optimal exact designs of experiments via mixed integer nonlinear programming ⋮ Systematic enumeration of definitive screening designs ⋮ Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Construction of exact D-optimal designs by tabu search
• An algorithm for arranging response surface designs in small blocks.
• Future paths for integer programming and links to artificial intelligence
• Heuristic optimization of experimental designs.
• Optimal multi-level supersaturated designs through integer programming
• Update formulas for split-plot and block designs
• A review of some exchange algorithms for constructing discrete \(D\)-optimal designs
• Metaheuristics
• Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces
• An Algorithmic Approach to Constructing Supersaturated Designs
• The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
• Constructing Exact D-Optimal Experimental Designs by Simulated Annealing
• The construction of exact D-optimum experimental designs with application to blocking response surface designs
• Some Systematic Supersaturated Designs
• A Comparison of Algorithms for Constructing Exact D-Optimal Designs
• Algorithmic complexity: threeNP- hard problems in computational statistics
• An Algorithm for the Construction of "D-Optimal" Experimental Designs
• Computer Construction of "D-Optimal" First-Order Designs
• Application of genetic algorithms to the construction of exact D-optimal designs
• Columnwise-Pairwise Algorithms with Applications to the Construction of Supersaturated Designs
• The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
• THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTS

This page was built for publication: Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm