Efficient computational algorithm for optimal continuous experimental designs
From MaRDI portal
Abstract: A simple yet efficient computational algorithm for computing the continuous optimal experimental design for linear models is proposed. An alternative proof the monotonic convergence for -optimal criterion on continuous design spaces are provided. We further show that the proposed algorithm converges to the -optimal design. We also provide an algorithm for the -optimality and conjecture that the algorithm convergence monotonically on continuous design spaces. Different numerical examples are used to demonstrated the usefulness and performance of the proposed algorithms.
Recommendations
- Combined algorithm to compute D-optimal designs
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
- Efficient computational algorithm for optimal allocation in regression models
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- An efficient algorithm for constructing optimal design of computer experiments
Cites work
- An algorithm for optimal designs on a design space
- Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
- Computing efficient exact designs of experiments using integer quadratic programming
- D-optimal design of a monitoring network for parameter estimation of distributed systems
- D-optimal designs via a cocktail algorithm
- Efficient computational algorithm for optimal allocation in regression models
- scientific article; zbMATH DE number 1100440 (Why is no real title available?)
- Optimum experimental designs, with SAS
- 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
- The Sequential Generation of D-Optimum Experimental Designs
Cited in
(13)- Computing optimal experimental designs with respect to a compound Bayes risk criterion
- Multi-stage differential evolution algorithm for constrained D-optimal design
- A new monotonic algorithm for the \(E\)-optimal experiment design problem
- Efficient computational algorithms for approximate optimal designs
- Efficient computational algorithm for optimal allocation in regression models
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
- On computationally tractable selection of experiments in measurement-constrained regression models
- Combined algorithm to compute D-optimal designs
- scientific article; zbMATH DE number 1419976 (Why is no real title available?)
- scientific article; zbMATH DE number 5274768 (Why is no real title available?)
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach
- Differential evolution variants for searching D- and A-optimal designs for nonlinear models in the bioscience
- An algorithm for computing generalized D -optimal allocation with cost consideration in regression models
This page was built for publication: Efficient computational algorithm for optimal continuous experimental designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1713154)