Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
From MaRDI portal
Publication:2631342
Recommendations
- Heuristic optimization of experimental designs.
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- A clustering-based coordinate exchange algorithm for generating G-optimal experimental designs
- A review of some exchange algorithms for constructing discrete D-optimal designs
- Truncated D-Optimal Designs for Screening Experiments
Cites work
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- A review of some exchange algorithms for constructing discrete D-optimal designs
- Algorithmic complexity: threeNP- hard problems in computational statistics
- An algorithm for arranging response surface designs in small blocks.
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- An Algorithmic Approach to Constructing Supersaturated Designs
- Application of genetic algorithms to the construction of exact D-optimal designs
- Columnwise-Pairwise Algorithms with Applications to the Construction of Supersaturated Designs
- Computer Construction of "D-Optimal" First-Order Designs
- Constructing Exact D-Optimal Experimental Designs by Simulated Annealing
- Construction of exact D-optimal designs by tabu search
- Future paths for integer programming and links to artificial intelligence
- Heuristic optimization of experimental designs.
- scientific article; zbMATH DE number 2130220 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- scientific article; zbMATH DE number 1464593 (Why is no real title available?)
- Metaheuristics
- Metaheuristics. From design to implementation.
- Optimal multi-level supersaturated designs through integer programming
- Optimization by simulated annealing
- Optimum experimental designs, with SAS
- Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces
- Some Systematic Supersaturated Designs
- The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
- The construction of exact D-optimum experimental designs with application to blocking response surface designs
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTS
- Update formulas for split-plot and block designs
Cited in
(12)- An algorithmic framework for generating optimal two-stratum experimental designs
- Optimal Bayesian design for discriminating between models with intractable likelihoods in epidemiology
- Using SeDuMi to find various optimal designs for regression models
- Systematic enumeration of definitive screening designs
- Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms
- Optimal exact designs of experiments via mixed integer nonlinear programming
- Efficient design of experiments for structural optimization using significance screening
- Efficient designs for Bayesian networks with sub-tree bounds
- A hybrid elitist Pareto-based coordinate exchange algorithm for constructing multi-criteria optimal experimental designs
- A clustering-based coordinate exchange algorithm for generating G-optimal experimental designs
- Two-level D- and A-optimal main-effects designs with run sizes one and two more than a multiple of four
- Optimizing Two-Arm Clinical Trials for Personalized Medicine Using Integer Programming and Heuristic Algorithms
This page was built for publication: Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631342)
