Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs
Publication:134017
DOI10.1016/J.CSDA.2016.06.014zbMath1464.62129OpenAlexW2475313441MaRDI QIDQ134017
Ehsan Masoudi, Weng Kee Wong, Heinz Holling, Heinz Holling, Weng Kee Wong, Ehsan Masoudi
Publication date: September 2017
Published in: Computational Statistics & Data Analysis, Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2016.06.014
local searchFisher information matrixevolutionary algorithm\(D\)-optimalitygeneral equivalence theoremapproximate design
Computational methods for problems pertaining to statistics (62-08) Optimal statistical designs (62K05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Imperialist competitive algorithm combined with chaos for global optimization
- D-optimal minimax design criterion for two-level fractional factorial designs
- D-optimal minimax regression designs on discrete design space
- Optimal Bayesian design applied to logistic regression experiments
- Bayesian D-optimal designs for exponential regression models
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- E-optimal design for the Michaelis-Menten model
- Minimax \(D\)-optimal designs for item response theory models
- Optimum experimental design in nonlinear regression
- An Introduction to Optimal Designs for Social and Biomedical Research
- Optimal designs for the emax, log-linear and exponential models
- The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
- Constructing Exact D-Optimal Experimental Designs by Simulated Annealing
- Experimental Design for Binary Data
- Application of genetic algorithms to the construction of exact D-optimal designs
- Robust and Efficient Designs for the Michaelis–Menten Model
- Minimax D‐Optimal Designs for the Logistic Model
- Optimal designs for the power logistic model
- Finding Near-Optimal Bayesian Experimental Designs via Genetic Algorithms
- Robust designs for binary data: applications of simulated annealing
- Optimal and Efficient Designs of Experiments
- Applied Optimal Designs
- Locally Optimal Designs for Estimating Parameters
- A locally-biased form of the DIRECT algorithm.
This page was built for publication: Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs