Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs
From MaRDI portal
(Redirected from Publication:134017)
DOI10.1016/J.CSDA.2016.06.014zbMATH Open1464.62129OpenAlexW2475313441MaRDI QIDQ134017FDOQ134017
Recommendations
- On optimal designs for nonlinear models: a general and efficient algorithm
- Differential evolutionary algorithm in the construction process of optimal experimental designs
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
- Particle swarm based algorithms for finding locally and Bayesian \(D\)-optimal designs
- Optimal Designs for Nonlinear Models with Random Block Effects
Cites work
- scientific article; zbMATH DE number 5919888 (Why is no real title available?)
- scientific article; zbMATH DE number 3940387 (Why is no real title available?)
- scientific article; zbMATH DE number 3734989 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1220667 (Why is no real title available?)
- scientific article; zbMATH DE number 1086072 (Why is no real title available?)
- scientific article; zbMATH DE number 845704 (Why is no real title available?)
- A locally-biased form of the DIRECT algorithm.
- Algorithmic searches for optimal designs
- An Introduction to Optimal Designs for Social and Biomedical Research
- Application of genetic algorithms to the construction of exact D-optimal designs
- Applied Optimal Designs
- Bayesian D-optimal designs for exponential regression models
- Constructing Exact D-Optimal Experimental Designs by Simulated Annealing
- D-optimal minimax design criterion for two-level fractional factorial designs
- D-optimal minimax regression designs on discrete design space
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- E-optimal design for the Michaelis-Menten model
- Experimental Design for Binary Data
- Finding near-optimal Bayesian experimental designs via genetic algorithms
- Imperialist competitive algorithm combined with chaos for global optimization
- Locally Optimal Designs for Estimating Parameters
- Locally \(D\)-optimal designs for exponential regression models
- Minimax D‐Optimal Designs for the Logistic Model
- Minimax \(D\)-optimal designs for item response theory models
- Optimal Bayesian design applied to logistic regression experiments
- Optimal and Efficient Designs of Experiments
- Optimal designs for the emax, log-linear and exponential models
- Optimal designs for the power logistic model
- Optimization by simulated annealing
- Optimum experimental design in nonlinear regression
- Optimum experimental designs, with SAS
- Robust and Efficient Designs for the Michaelis–Menten Model
- Robust designs for binary data: applications of simulated annealing
- The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
Cited in
(16)- Optimal design of multifactor experiments via grid exploration
- Differential evolutionary algorithm in the construction process of optimal experimental designs
- \(I_L\)-optimal designs for regression models under the second-order least squares estimator
- Particle swarm optimization for searching efficient experimental designs: a review
- Particle swarm based algorithms for finding locally and Bayesian \(D\)-optimal designs
- Optimal designs for nonlinear mixed-effects models using competitive swarm optimizer with mutated agents
- Optimal designs for linear regression models with skew-normal errors
- Response surface optimization for a nonlinearly constrained irregular experimental design space
- A Metaheuristic Adaptive Cubature Based Algorithm to Find Bayesian Optimal Designs for Nonlinear Models
- Adaptive grid semidefinite programming for finding optimal designs
- ICAOD
- Design admissibility and de la Garza phenomenon in multifactor experiments
- On optimal designs for nonlinear models: a general and efficient algorithm
- Special issue on design of experiments
- An algorithm based on semidefinite programming for finding minimax optimal designs
- A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
This page was built for publication: Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q134017)
