Multiplicative methods for computing D-optimal stratified designs of experiments
From MaRDI portal
Publication:393589
Recommendations
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- Multiplicative algorithms for computing optimum designs
- Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments
- Combined algorithm to compute D-optimal designs
- Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
Cites work
- scientific article; zbMATH DE number 3945143 (Why is no real title available?)
- scientific article; zbMATH DE number 2135377 (Why is no real title available?)
- scientific article; zbMATH DE number 854710 (Why is no real title available?)
- A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
- An algorithm for optimal designs on a design space
- Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
- Barycentric coordinates for convex sets
- Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
- Constructing optimal designs with constraints
- Construction of marginally and conditionally restricted designs using multiplicative algorithms
- Convex analysis and nonlinear optimization. Theory and examples
- D-optimal design of a monitoring network for parameter estimation of distributed systems
- D-optimal designs via a cocktail algorithm
- Determinant Maximization with Linear Matrix Inequality Constraints
- General equivalence theory for optimum designs (approximate theory)
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- Invited Discussion Paper Constrained Optimization of Experimental Design
- Lectures on Choquet's theorem
- Marginally Restricted D-Optimal Designs
- Marginally restricted linear-optimal designs
- Marginally restricted sequential D‐optimal designs
- Model-oriented design of experiments
- Monotonic convergence of a general algorithm for computing optimal designs
- Multiplicative algorithms for computing optimum designs
- Optimal Design of Experiments
- Optimum Designs in Regression Problems
- Optimum experimental designs, with SAS
- Some algorithmic aspects of the theory of optimal designs
- Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
- The Equivalence of Two Extremum Problems
- Two classes of multiplicative algorithms for constructing optimizing distributions
Cited in
(12)- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- An algorithmic framework for generating optimal two-stratum experimental designs
- Construction of efficient experimental designs under multiple resource constraints
- Stochastic natural frequency of composite conical shells
- Multiplicative algorithms for computing optimum designs
- Whole-plot exchange algorithms for constructing D-optimal multistratum designs
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- Mixed-integer linear programming for computing optimal experimental designs
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments
- Removal of the points that do not support an \(E\)-optimal experimental design
- Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space
This page was built for publication: Multiplicative methods for computing \(D\)-optimal stratified designs of experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393589)
