Multiplicative algorithms for computing optimum designs
From MaRDI portal
Publication:730813
DOI10.1016/j.jspi.2009.05.007zbMath1190.62138MaRDI QIDQ730813
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
62K05: Optimal statistical designs
Related Items
On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm, K-Optimal Design via Semidefinite Programming and Entropy Optimization, A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach, Optimal Design of Experiments for Implicit Models, A-optimal design for the special cubic mixture model, Efficient computational algorithm for optimal allocation in regression models, Multiplicative methods for computing \(D\)-optimal stratified designs of experiments, Combined algorithm to compute D-optimal designs, Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments, Near G-optimal Tchakaloff designs, Optimal designs subject to cost constraints in simultaneous equations models, Monotonic convergence of a general algorithm for computing optimal designs, Adaptive grid semidefinite programming for finding optimal designs, A branch-and-bound algorithm for the exact optimal experimental design problem, Fast algorithms for the minimum volume estimator, A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Optimal allocation of bioassays in the case of parametrized covariance functions: an application to lung's retention of radioactive particles
- Improving updating rules in multiplicative algorithms for computing \(D\)-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)
- The covergence of general step-length algorithms for regular optimum design criteria
- Removing non-optimal support points in \(D\)-optimum design algorithms.
- Optimum designs for multi-factor models
- An algorithm for the computation of optimum designs under a given covariance structure
- Construction of optimal designs using a clustering approach
- DESIGN OF EXPERIMENTS IN NON-LINEAR SITUATIONS
- Experimental Design for Time-Dependent Models with Correlated Observations
- Marginally restricted D-optimal designs for correlated observations
- W-Iterations and Ripples Therefrom
- The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
- The construction of exact D-optimum experimental designs with application to blocking response surface designs
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- An algorithm for optimal designs on a design space
- Some iterative procedures for generating nonsingular optimal designs
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- Optimum Dose Levels when Males and Females Differ in Response
- The Sequential Generation of $D$-Optimum Experimental Designs
- A geometric approach to optimal design theory
