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

DOI10.1080/00949655.2015.1077252OpenAlexW1737110581MaRDI QIDQ5222425FDOQ5222425

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

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

zbMATH Keywords

generalized linear modelsexchange algorithmrobust designK-means clusteringalphabetical optimal design

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Title not available (Why is that?)
• A review of some exchange algorithms for constructing discrete \(D\)-optimal designs
• Title not available (Why is that?)
• Optimum Designs in Regression Problems
• 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
• Title not available (Why is that?)
• Experimental Design for Binary Data
• Robust designs for binary data: applications of simulated annealing
• Optimal and Efficient Designs of Experiments
• The Sequential Generation of $D$-Optimum Experimental Designs
• Optimal Design of Experiments
• An Algorithm for the Construction of "D-Optimal" Experimental Designs
• Optimum Designs in Regression Problems, II
• Optimal designs for binary data under logistic regression
• A Comparison of Algorithms for Constructing Exact D-Optimal Designs
• The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
• Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
• Title not available (Why is that?)
• The construction of exact D-optimum experimental designs with application to blocking response surface designs
• Title not available (Why is that?)
• Generalized linear models. With applications in engineering and the sciences.
• Title not available (Why is that?)

Cited In (3)

• Constructing efficient experimental designs for generalized linear models
• 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

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)