Hybrid algorithms for generating optimal designs for discriminating multiple nonlinear models under various error distributional assumptions

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

Abstract

Finding a model-based optimal design that can optimally discriminate among a class of plausible models is a difficult task because the design criterion is non-differentiable and requires 2 or more layers of nested optimization. We propose hybrid algorithms based on particle swarm optimization (PSO) to solve such optimization problems, including cases when the optimal design is singular, the mean response of some models are not fully specified and problems that involve 4 layers of nested optimization. Using several classical examples, we show that the proposed PSO-based algorithms are not models or criteria specific, and with a few repeated runs, can produce either an optimal design or a highly efficient design. They are also generally faster than the current algorithms, which are generally slow and work for only specific models or discriminating criteria. As an application, we apply our techniques to find optimal discriminating designs for a dose-response study in toxicology with 5 possible models and compare their performances with traditional and a recently proposed algorithm. In the supplementary material, we provide a R package to generate different types of discriminating designs and evaluate efficiencies of competing designs so that the user can implement an informed design.

Cite

CITATION STYLE

APA

Chen, R. B., Chen, P. Y., Hsu, C. L., & Wong, W. K. (2020). Hybrid algorithms for generating optimal designs for discriminating multiple nonlinear models under various error distributional assumptions. PLoS ONE, 15(10 October). https://doi.org/10.1371/journal.pone.0239864

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