A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs

abr. 1, 2020·
Ricardo García-Ródenas
José Carlos García-García
Jesús López-Fidalgo
José Ángel Martín-Baos
Weng Kee Wong
· 0 min de lectura
Several common general purpose optimization algorithms are compared for finding A- and D-optimal designs for different types of statistical models of varying complexity, including high dimensional models with five and more factors. The algorithms of interest include exact methods, such as the interior point method, the Nelder–Mead method, the active set method, the sequential quadratic programming, and metaheuristic algorithms, such as particle swarm optimization, simulated annealing and genetic algorithms. Several simulations are performed, which provide general recommendations on the utility and performance of each method, including hybridized versions of metaheuristic algorithms for finding optimal experimental designs. A key result is that general-purpose optimization algorithms, both exact methods and metaheuristic algorithms, perform well for finding optimal approximate experimental designs.
Computational Statistics and Data Analysis