A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
From MaRDI portal
Publication:2291279
DOI10.1016/j.csda.2019.106844zbMath1504.62120WikidataQ127109139 ScholiaQ127109139MaRDI QIDQ2291279
Weng Kee Wong, José Carlos García-García, Ricardo García-Ródenas, José Ángel Martín-Baos, Jesús López-Fidalgo
Publication date: 30 January 2020
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10578/28850
information matrix; efficiency; metaheuristics; equivalence theorem; optimality criteria; approximate design
Related Items
An exchange algorithm for optimal calibration of items in computerized achievement tests, ODEm, Review on nature-inspired algorithms, A branch-and-bound algorithm for the exact optimal experimental design problem, Optimal design of multifactor experiments via grid exploration, Ta algorithms for D-optimal OofA mixture designs, Optimal designs for mixed continuous and binary responses with quantitative and qualitative factors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- D-optimal designs via a cocktail algorithm
- Ant colony optimization for continuous domains
- Minimax and Minimax Projection Designs Using Clustering
- High-speed railway scheduling based on user preferences
- A note on the de la Garza phenomenon for locally optimal designs
- A genetic algorithm for designing microarray experiments
- Optimizing Latin hypercube designs by particle swarm
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Construction of marginally and conditionally restricted designs using multiplicative algorithms
- Optimal Bayesian design applied to logistic regression experiments
- General equivalence theory for optimum designs (approximate theory)
- Convergent design sequences, for sufficiently regular optimality criteria
- Simulated annealing: Practice versus theory
- Optimization theory and methods. Nonlinear programming
- An iterated local search algorithm for the vehicle routing problem with backhauls
- A review of some exchange algorithms for constructing discrete \(D\)-optimal designs
- A sequential quadratic programming algorithm with an additional equality constrained phase
- Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces
- An Introduction to Optimal Designs for Social and Biomedical Research
- General weighted optimality of designed experiments
- The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- D-optimal Designs with Ordered Categorical Data
- Minimax D‐Optimal Designs for the Logistic Model
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- A Stable and Efficient Method for Solving a Convex Quadratic Program with Application to Optimal Control
- An improved multi-objective optimization method based on adaptive mutation particle swarm optimization and fuzzy statistics algorithm
- Finding Near-Optimal Bayesian Experimental Designs via Genetic Algorithms
- On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm
- Computing Optimal Experimental Designs via Interior Point Method
- A Simplex Method for Function Minimization
- Locally Optimal Designs for Estimating Parameters
- Exchange algorithms for constructing large spatial designs
