Toward more numerically stable computations of optimal experimental designs
From MaRDI portal
Cites work
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- A vertex-exchange-method in D-optimal design theory
- An algorithm for optimal designs on a design space
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- D-optimal designs via a cocktail algorithm
- Design issues for generalized linear models: a review
- Design of experiments in nonlinear models. Asymptotic normality, optimality criteria and small-sample properties
- Designs for generalized linear models
- Experimental Design for Time-Dependent Models with Correlated Observations
- scientific article; zbMATH DE number 3976138 (Why is no real title available?)
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 800961 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Minimum-volume ellipsoids. Theory and algorithms
- On greedy heuristics for computing D-efficient saturated subsets
- Optimal design of multifactor experiments via grid exploration
- Optimum experimental designs, with SAS
- The Sequential Generation of D-Optimum Experimental Designs
This page was built for publication: Toward more numerically stable computations of optimal experimental designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971492)