A clustering-based coordinate exchange algorithm for generating G-optimal experimental designs

DOI10.1080/00949655.2015.1077252MaRDI QIDQ5222425zbMATH OpenOpenAlexFDO

Authors Moein Saleh, Rong Pan

Publication date 1 April 2020

Published in Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00949655.2015.1077252

zbMATH Keywords

generalized linear modelsexchange algorithmrobust designK-means clusteringalphabetical optimal design

Mathematics Subject Classification ID

Statistics (62-XX)

Recommendations

• Constructing efficient experimental designs for generalized linear models
• An efficient algorithm for constructing optimal design of computer experiments
• Heuristic optimization of experimental designs.
• Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
• A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments

Cites work

• scientific article; zbMATH DE number 3176492 (Why is no real title available?)
• scientific article; zbMATH DE number 47310 (Why is no real title available?)
• scientific article; zbMATH DE number 410131 (Why is no real title available?)
• scientific article; zbMATH DE number 6876120 (Why is no real title available?)
• scientific article; zbMATH DE number 788255 (Why is no real title available?)
• scientific article; zbMATH DE number 3411979 (Why is no real title available?)
• A Comparison of Algorithms for Constructing Exact D-Optimal Designs
• A review of some exchange algorithms for constructing discrete \(D\)-optimal designs
• An Algorithm for the Construction of "D-Optimal" Experimental Designs
• Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
• Constructing Exact D-Optimal Experimental Designs by Simulated Annealing
• Experimental Design for Binary Data
• Generalized linear models. With applications in engineering and the sciences.
• Optimal Design of Experiments
• Optimal and Efficient Designs of Experiments
• Optimal designs for binary data under logistic regression
• Optimum Designs in Regression Problems
• Optimum Designs in Regression Problems, II
• Robust designs for binary data: applications of simulated annealing
• The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
• The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
• The Sequential Generation of $D$-Optimum Experimental Designs
• The construction of exact D-optimum experimental designs with application to blocking response surface designs

Cited in

(3)

• Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
• A hybrid elitist Pareto-based coordinate exchange algorithm for constructing multi-criteria optimal experimental designs
• Constructing efficient experimental designs for generalized linear models

This page was built for publication: A clustering-based coordinate exchange algorithm for generating G-optimal experimental designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222425)