A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
From MaRDI portal
Publication:2291279
Recommendations
- Application of genetic algorithms to the construction of exact D-optimal designs
- Heuristic optimization of experimental designs.
- Differential evolutionary algorithm in the construction process of optimal experimental designs
- Particle swarm based algorithms for finding locally and Bayesian \(D\)-optimal designs
- Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs
Cites work
- scientific article; zbMATH DE number 3945143 (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 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 3393615 (Why is no real title available?)
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- A Simplex Method for Function Minimization
- A genetic algorithm for designing microarray experiments
- A note on the de la Garza phenomenon for locally optimal designs
- A review of some exchange algorithms for constructing discrete D-optimal designs
- A sequential quadratic programming algorithm with an additional equality constrained phase
- A stable and efficient method for solving a convex quadratic program with application to optimal control
- An Introduction to Optimal Designs for Social and Biomedical Research
- An improved multi-objective optimization method based on adaptive mutation particle swarm optimization and fuzzy statistics algorithm
- An iterated local search algorithm for the vehicle routing problem with backhauls
- Ant colony optimization for continuous domains
- Computing optimal experimental designs via interior point method
- Construction of marginally and conditionally restricted designs using multiplicative algorithms
- Convergent design sequences, for sufficiently regular optimality criteria
- D-optimal designs via a cocktail algorithm
- D-optimal designs with ordered categorical data
- Exchange algorithms for constructing large spatial designs
- Finding near-optimal Bayesian experimental designs via genetic algorithms
- General equivalence theory for optimum designs (approximate theory)
- General weighted optimality of designed experiments
- High-speed railway scheduling based on user preferences
- Locally Optimal Designs for Estimating Parameters
- Locally \(D\)-optimal designs for exponential regression models
- Minimax D‐Optimal Designs for the Logistic Model
- Minimax and Minimax Projection Designs Using Clustering
- On optimal designs for nonlinear models: a general and efficient algorithm
- Optimal Bayesian design applied to logistic regression experiments
- Optimization by simulated annealing
- Optimization theory and methods. Nonlinear programming
- Optimizing Latin hypercube designs by particle swarm
- Simulated annealing: Practice versus theory
- Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces
- The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(15)- An adjustment algorithm for optimal run orders in design of experiments
- Developing effective meta-heuristics for a probabilistic location model via experimental design
- Optimal designs for mixed continuous and binary responses with quantitative and qualitative factors
- Comparative study of algorithms for response surface optimization
- ODEm
- An algorithmic framework for generating optimal two-stratum experimental designs
- Particle swarm based algorithms for finding locally and Bayesian \(D\)-optimal designs
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- A branch-and-bound algorithm for the exact optimal experimental design problem
- Optimal design of multifactor experiments via grid exploration
- scientific article; zbMATH DE number 815110 (Why is no real title available?)
- Ta algorithms for D-optimal OofA mixture designs
- Design and Analysis of Optimization Algorithms Using Computational Statistics
- An exchange algorithm for optimal calibration of items in computerized achievement tests
- Review on nature-inspired algorithms
This page was built for publication: A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291279)
