Multiplicative methods for computing D-optimal stratified designs of experiments
From MaRDI portal
Publication:393589
DOI10.1016/J.JSPI.2013.10.003zbMATH Open1279.62152OpenAlexW2090951881MaRDI QIDQ393589FDOQ393589
Authors: Radoslav Harman 
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
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
\(D\)-optimal designsbarycentric algorithmmarginal constraintsmultiplicative algorithmstratified designs
Cites Work
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
- D-optimal designs via a cocktail algorithm
- General equivalence theory for optimum designs (approximate theory)
- 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
- 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
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- Monotonic convergence of a general algorithm for computing optimal designs
- Optimum Designs in Regression Problems
- Optimal Design of Experiments
- Title not available (Why is that?)
- Lectures on Choquet's theorem
- Convex analysis and nonlinear optimization. Theory and examples
- Title not available (Why is that?)
- Model-oriented design of experiments
- Barycentric coordinates for convex sets
- Two classes of multiplicative algorithms for constructing optimizing distributions
- Determinant Maximization with Linear Matrix Inequality Constraints
- Multiplicative algorithms for computing optimum designs
- Construction of marginally and conditionally restricted designs using multiplicative algorithms
- Marginally restricted linear-optimal designs
- A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
- D-optimal design of a monitoring network for parameter estimation of distributed systems
- 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
- Title not available (Why is that?)
- Invited Discussion Paper Constrained Optimization of Experimental Design
- Marginally restricted sequential D‐optimal designs
- Constructing optimal designs with constraints
Cited In (12)
- Multiplicative algorithms for computing optimum designs
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- Removal of the points that do not support an \(E\)-optimal experimental design
- Whole-plot exchange algorithms for constructing D-optimal multistratum designs
- Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space
- Mixed-integer linear programming for computing optimal experimental designs
- Stochastic natural frequency of composite conical shells
- An algorithmic framework for generating optimal two-stratum experimental designs
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- Construction of efficient experimental designs under multiple resource constraints
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments
Uses Software
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)
