Multiplicative methods for computing \(D\)-optimal stratified designs of experiments
From MaRDI portal
Publication:393589
DOI10.1016/j.jspi.2013.10.003zbMath1279.62152OpenAlexW2090951881MaRDI QIDQ393589
Publication date: 23 January 2014
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2013.10.003
\(D\)-optimal designsbarycentric algorithmmarginal constraintsmultiplicative algorithmstratified designs
Related Items
Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space, Computing exact \(D\)-optimal designs by mixed integer second-order cone programming, Stochastic natural frequency of composite conical shells, Removal of the points that do not support an \(E\)-optimal experimental design, Construction of efficient experimental designs under multiple resource constraints, A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments, Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- D-optimal designs via a cocktail algorithm
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
- Constructing optimal designs with constraints
- Multiplicative algorithms for computing optimum designs
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- Monotonic convergence of a general algorithm for computing optimal designs
- Two classes of multiplicative algorithms for constructing optimizing distributions
- Construction of marginally and conditionally restricted designs using multiplicative algorithms
- General equivalence theory for optimum designs (approximate theory)
- Some algorithmic aspects of the theory of optimal designs
- Model-oriented design of experiments
- Convex analysis and nonlinear optimization. Theory and examples
- Marginally restricted linear-optimal designs
- A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
- Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
- Barycentric coordinates for convex sets
- D-optimal design of a monitoring network for parameter estimation of distributed systems
- Optimum Designs in Regression Problems
- The Equivalence of Two Extremum Problems
- Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
- Marginally Restricted D-Optimal Designs
- Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
- An algorithm for optimal designs on a design space
- Determinant Maximization with Linear Matrix Inequality Constraints
- Invited Discussion Paper Constrained Optimization of Experimental Design
- Optimal Design of Experiments
- Marginally restricted sequential D‐optimal designs
- Lectures on Choquet's theorem
