Multiplicative algorithms for computing optimum designs
From MaRDI portal
Publication:730813
DOI10.1016/J.JSPI.2009.05.007zbMATH Open1190.62138OpenAlexW2044844141MaRDI QIDQ730813FDOQ730813
Authors: B. Torsney, Raúl Martín-Martín 
Publication date: 1 October 2009
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.2009.05.007
Recommendations
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- Algorithms for optimal design with application to multiple polynomial regression
- Optimal design of experiments subject to correlated errors
- Multiplicative methods for computing \(D\)-optimal stratified designs of experiments
- Measures for designs in experiments with correlated errors
Cites Work
- Title not available (Why is that?)
- General equivalence theory for optimum designs (approximate theory)
- Construction of optimal designs using a clustering approach
- Optimum experimental designs, with SAS
- An algorithm for optimal designs on a design space
- Title not available (Why is that?)
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
- The Sequential Generation of $D$-Optimum Experimental Designs
- Optimum designs for multi-factor models
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- DESIGN OF EXPERIMENTS IN NON-LINEAR SITUATIONS
- Experimental Design for Time-Dependent Models with Correlated Observations
- Two classes of multiplicative algorithms for constructing optimizing distributions
- Some iterative procedures for generating nonsingular optimal designs
- A geometric approach to optimal design theory
- Construction of marginally and conditionally restricted designs using multiplicative algorithms
- Optimum Dose Levels when Males and Females Differ in Response
- W-iterations and ripples therefrom
- The construction of exact D-optimum experimental designs with application to blocking response surface designs
- Removing non-optimal support points in \(D\)-optimum design algorithms.
- Title not available (Why is that?)
- An algorithm for the computation of optimum designs under a given covariance structure
- The covergence of general step-length algorithms for regular optimum design criteria
- Title not available (Why is that?)
- Marginally restricted D-optimal designs for correlated observations
- Optimal allocation of bioassays in the case of parametrized covariance functions: an application to lung's retention of radioactive particles
Cited In (23)
- Multiplicative methods for computing \(D\)-optimal stratified designs of experiments
- On optimal designs for nonlinear models: a general and efficient algorithm
- Hierarchical optimal designs and modeling for engineering: a case-study in the rail sector
- Title not available (Why is that?)
- Adaptive grid semidefinite programming for finding optimal designs
- Construction of optimal designs using a clustering approach
- Efficient algorithms for optimal designs with correlated observations in pharmacokinetics and dose-finding studies
- Optimal stress levels in accelerated degradation testing for various degradation models
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- Fast algorithms for the minimum volume estimator
- Combined algorithm to compute D-optimal designs
- Optimal designs subject to cost constraints in simultaneous equations models
- \(K\)-optimal design via semidefinite programming and entropy optimization
- A branch-and-bound algorithm for the exact optimal experimental design problem
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach
- An algorithm for the computation of optimum designs under a given covariance structure
- Near G-optimal Tchakaloff designs
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- Monotonic convergence of a general algorithm for computing optimal designs
- Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments
- A-optimal design for the special cubic mixture model
- Optimal Design of Experiments for Implicit Models
- Efficient computational algorithm for optimal allocation in regression models
This page was built for publication: Multiplicative algorithms for computing optimum designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730813)
