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

DOI10.1080/00949655.2015.1077252OpenAlexW1737110581MaRDI QIDQ5222425

Rong Pan, Moein Saleh

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

robust designexchange algorithmgeneralized linear modelsK-means clusteringalphabetical optimal design

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A review of some exchange algorithms for constructing discrete \(D\)-optimal designs
• Optimum Designs in Regression Problems
• Optimum Designs in Regression Problems, II
• 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
• A Comparison of Algorithms for Constructing Exact D-Optimal Designs
• Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
• Experimental Design for Binary Data
• An Algorithm for the Construction of "D-Optimal" Experimental Designs
• The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
• Optimal Design of Experiments
• Robust designs for binary data: applications of simulated annealing
• Optimal and Efficient Designs of Experiments
• The Sequential Generation of $D$-Optimum Experimental Designs
• Optimal designs for binary data under logistic regression