Efficient computational algorithms for approximate optimal designs

DOI10.1080/00949655.2021.1974439OpenAlexW3200214356MaRDI QIDQ3390584

Yanyuan Ma, Wei Gao, Hon Keung Tony Ng, Jiangtao Duan

Publication date: 24 March 2022

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

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

zbMATH Keywords

regression model\(D\)-optimal\(A\)-optimalapproximate experimental design

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• D-optimal designs via a cocktail algorithm
• Efficient computational algorithm for optimal allocation in regression models
• General equivalence theory for optimum designs (approximate theory)
• Efficient computational algorithm for optimal continuous experimental designs
• Approximate optimal designs for multivariate polynomial regression
• Optimum Designs in Regression Problems
• A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
• Algorithmic complexity: threeNP- hard problems in computational statistics
• Model Robust, Linear-Optimal Designs
• An algorithm for optimal designs on a design space
• The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
• Optimal Design of Experiments
• The Sequential Generation of $D$-Optimum Experimental Designs

This page was built for publication: Efficient computational algorithms for approximate optimal designs