Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs
type: Item
instance of: scholarly article
published in: Computational Statistics and Data Analysis
volume: 113
page(s): 330-345
publication date: 2017-09-01T00:00:00Z
publication date: 2018-08-14T00:00:00Z
author: Ehsan Masoudi
author: Heinz Holling
author: Weng Kee Wong
title: Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs
zbMATH Open document ID: 1464.62129
Mathematics Subject Classification ID: 62-08
Mathematics Subject Classification ID: 62K05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6917617
zbMATH Keywords: approximate design
zbMATH Keywords: \(D\)-optimality
zbMATH Keywords: evolutionary algorithm
zbMATH Keywords: Fisher information matrix
zbMATH Keywords: general equivalence theorem
zbMATH Keywords: local search
describes a project that uses: GAMS
describes a project that uses: pso
describes a project that uses: Rsolnp
describes a project that uses: R
describes a project that uses: Rcpp
describes a project that uses: NLopt
MaRDI profile type: Publication
full work available at URL: j.csda.2016.06.014
OpenAlex ID: W2475313441
cites work: Experimental Design for Binary Data
cites work: Q4864283
cites work: Q3445852
cites work: Optimal and Efficient Designs of Experiments
cites work: Minimax \(D\)-optimal designs for item response theory models
cites work: An Introduction to Optimal Designs for Social and Biomedical Research
cites work: Applied Optimal Designs
cites work: Optimal Bayesian design applied to logistic regression experiments
cites work: Locally Optimal Designs for Estimating Parameters
cites work: Q4363996
cites work: Robust and Efficient Designs for the Michaelis–Menten Model
cites work: Optimal designs for the emax, log-linear and exponential models
cites work: Q3427557
cites work: Bayesian D-optimal designs for exponential regression models
cites work: E-optimal design for the Michaelis-Menten model
cites work: A locally-biased form of the DIRECT algorithm.
cites work: The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
cites work: Finding Near-Optimal Bayesian Experimental Designs via Genetic Algorithms
cites work: Q4079017
cites work: Q3015779
cites work: Q3711436
cites work: Minimax D‐Optimal Designs for the Logistic Model
cites work: Optimal designs for the power logistic model
cites work: Optimization by Simulated Annealing
cites work: Q4219536
cites work: Algorithmic searches for optimal designs
cites work: Constructing Exact D-Optimal Experimental Designs by Simulated Annealing
cites work: Application of genetic algorithms to the construction of exact D-optimal designs
cites work: Optimum experimental design in nonlinear regression
cites work: Q3922026
cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
cites work: Imperialist competitive algorithm combined with chaos for global optimization
cites work: D-optimal minimax design criterion for two-level fractional factorial designs
cites work: Robust designs for binary data: applications of simulated annealing
cites work: D-optimal minimax regression designs on discrete design space
DOI: 10.1016/J.CSDA.2016.06.014
description: scientific article; zbMATH DE number 6917617