Particle swarm based algorithms for finding locally and Bayesian D-optimal designs

15Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

When a model-based approach is appropriate, an optimal design can guide how to collect data judiciously for making reliable inference at minimal cost. However, finding optimal designs for a statistical model with several possibly interacting factors can be both theoretically and computationally challenging, and this issue is rarely discussed in the literature. We propose nature-inspired metaheuristic algorithms, like particle swarm optimization (PSO) and its variants, to solve such optimization problems. We demonstrate that such techniques, which are easy to implement, can find different types of optimal designs for models with several factors efficiently. To facilitate use of such algorithms, we provide computer codes to generate tailor made optimal designs and evaluate efficiencies of competing designs. As applications, we apply PSO and find Bayesian optimal designs for Exponential models useful in HIV studies and re-design a car-refuelling study for a Logistic model with ten factors and some interacting factors.

Cite

CITATION STYLE

APA

Shi, Y., Zhang, Z., & Wong, W. K. (2019). Particle swarm based algorithms for finding locally and Bayesian D-optimal designs. Journal of Statistical Distributions and Applications, 6(1). https://doi.org/10.1186/s40488-019-0092-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free