A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
From MaRDI portal
Publication:2291279
DOI10.1016/J.CSDA.2019.106844zbMATH Open1504.62120OpenAlexW2979326761WikidataQ127109139 ScholiaQ127109139MaRDI QIDQ2291279FDOQ2291279
Authors: R. García-Ródenas, José Carlos García-García, Jesús López-Fidalgo, José Ángel Martín-Baos, Weng Kee Wong 
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
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
- Minimax and Minimax Projection Designs Using Clustering
- Title not available (Why is that?)
- Optimization by simulated annealing
- A review of some exchange algorithms for constructing discrete \(D\)-optimal designs
- Title not available (Why is that?)
- On optimal designs for nonlinear models: a general and efficient algorithm
- A Simplex Method for Function Minimization
- D-optimal designs via a cocktail algorithm
- General equivalence theory for optimum designs (approximate theory)
- Convergent design sequences, for sufficiently regular optimality criteria
- Locally \(D\)-optimal designs for exponential regression models
- Finding near-optimal Bayesian experimental designs via genetic algorithms
- Title not available (Why is that?)
- Ant colony optimization for continuous domains
- Optimization theory and methods. Nonlinear programming
- Optimal Bayesian design applied to logistic regression experiments
- An Introduction to Optimal Designs for Social and Biomedical Research
- The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
- Title not available (Why is that?)
- Minimax D‐Optimal Designs for the Logistic Model
- Locally Optimal Designs for Estimating Parameters
- Title not available (Why is that?)
- A stable and efficient method for solving a convex quadratic program with application to optimal control
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- A note on the de la Garza phenomenon for locally optimal designs
- An iterated local search algorithm for the vehicle routing problem with backhauls
- High-speed railway scheduling based on user preferences
- Simulated annealing: Practice versus theory
- A sequential quadratic programming algorithm with an additional equality constrained phase
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- Construction of marginally and conditionally restricted designs using multiplicative algorithms
- Exchange algorithms for constructing large spatial designs
- Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces
- Computing optimal experimental designs via interior point method
- A genetic algorithm for designing microarray experiments
- Optimizing Latin hypercube designs by particle swarm
- General weighted optimality of designed experiments
- D-optimal designs with ordered categorical data
- An improved multi-objective optimization method based on adaptive mutation particle swarm optimization and fuzzy statistics 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
- 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
- ODEm
- A branch-and-bound algorithm for the exact optimal experimental design problem
- Optimal design of multifactor experiments via grid exploration
- Title not available (Why is that?)
- 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)
