Optimal design of multifactor experiments via grid exploration
From MaRDI portal
Publication:2058892
DOI10.1007/S11222-021-10046-2zbMATH Open1475.62035arXiv2104.03995OpenAlexW3200002158MaRDI QIDQ2058892FDOQ2058892
Authors: Radoslav Harman, Lenka Filová, Samuel Rosa 
Publication date: 10 December 2021
Published in: Statistics and Computing (Search for Journal in Brave)
Abstract: For computing efficient approximate designs of multifactor experiments, we propose a simple algorithm based on adaptive exploration of the grid of all combinations of factor levels. We demonstrate that the algorithm significantly outperforms several state-of-the-art competitors for problems with discrete, continuous, as well as mixed factors. Importantly, we provide a free R code that permits direct verification of the numerical results and allows the researchers to easily compute optimal or nearly-optimal experimental designs for their own statistical models.
Full work available at URL: https://arxiv.org/abs/2104.03995
Recommendations
- Heuristic optimization of experimental designs.
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- A new approach to the construction of optimal designs
- An efficient algorithm for constructing optimal design of computer experiments
- Exact optimal experimental designs with constraints
Computational methods for problems pertaining to statistics (62-08) Optimal statistical designs (62K05) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs
- A Metaheuristic Adaptive Cubature Based Algorithm to Find Bayesian Optimal Designs for Nonlinear Models
- A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
- On optimal designs for nonlinear models: a general and efficient algorithm
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
- D-optimal designs via a cocktail algorithm
- Computing \(c\)-optimal experimental designs using the simplex method of linear programming
- A vertex-exchange-method in D-optimal design theory
- Some algorithmic aspects of the theory of optimal designs
- Optimum experimental designs, with SAS
- An algorithm for optimal designs on a design space
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Optimal Bayesian design applied to logistic regression experiments
- A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
- Minimax optimal designs via particle swarm optimization methods
- Title not available (Why is that?)
- Locally Optimal Designs for Estimating Parameters
- Adaptive grid semidefinite programming for finding optimal designs
- Optimal Design of Experiments
- Optimum designs for multi-factor models
- Title not available (Why is that?)
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems
- Optimal designs for rational function regression
- Admissible experimental designs in multiple polynomial regression
- On locally optimal designs for generalized linear models with group effects
- Design issues for generalized linear models: a review
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- Applications of necessary and sufficient conditions for maximin efficient designs
- Sequences converging to D-optimal designs of experiments
- Some iterative procedures for generating nonsingular optimal designs
- Determinant Maximization with Linear Matrix Inequality Constraints
- D-optimal design of a monitoring network for parameter estimation of distributed systems
- Design of experiments in nonlinear models. Asymptotic normality, optimality criteria and small-sample properties
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
- Construction of efficient experimental designs under multiple resource constraints
- Ascent with quadratic assistance for the construction of exact experimental designs
- Maximin efficient design of experiment for exponential regression models
- On greedy heuristics for computing D-efficient saturated subsets
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- Designs for generalized linear models
Cited In (3)
This page was built for publication: Optimal design of multifactor experiments via grid exploration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2058892)
