Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs

DOI10.1016/j.csda.2008.10.002zbMath1231.62141OpenAlexW2126439981MaRDI QIDQ961114

Andrey Pepelyshev, Anatoly A. Zhigljavsky, Dette, Holger

Publication date: 30 March 2010

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2008.10.002

Mathematics Subject Classification ID

Related Items (25)

Optimal Design of Experiments for Implicit Models ⋮ Submodularity and Randomized rounding techniques for Optimal Experimental Design ⋮ `Nearly' universally optimal designs for models with correlated observations ⋮ Efficient Algorithms for Optimal Designs with Correlated Observations in Pharmacokinetics and Dose-Finding Studies ⋮ Optimal designs for comparing curves ⋮ Robust static designs for approximately specified nonlinear regression models ⋮ Efficient computational algorithm for optimal allocation in regression models ⋮ Multiplicative methods for computing \(D\)-optimal stratified designs of experiments ⋮ Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming ⋮ Adaptive grid semidefinite programming for finding optimal designs ⋮ Optimal design for linear models with correlated observations ⋮ A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria ⋮ Bayesian optimum designs for discriminating between models with any distribution ⋮ Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs ⋮ Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria ⋮ Combined algorithm to compute D-optimal designs ⋮ A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments ⋮ A new monotonic algorithm for the \(E\)-optimal experiment design problem ⋮ D-optimal designs based on the second-order least squares estimator ⋮ Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments ⋮ Monotonic convergence of a general algorithm for computing optimal designs ⋮ D-optimal designs via a cocktail algorithm ⋮ Multiplicative algorithms for computing optimum designs ⋮ Near G-optimal Tchakaloff designs ⋮ K-Optimal Design via Semidefinite Programming and Entropy Optimization

Cites Work

• Optimal weights for experimental designs on linearly independent support points
• Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
• Optimal Bayesian design applied to logistic regression experiments
• General equivalence theory for optimum designs (approximate theory)
• Removing non-optimal support points in \(D\)-optimum design algorithms.
• Bayesian experimental design: A review
• Construction of optimal designs using a clustering approach
• The Equivalence of Two Extremum Problems
• W-Iterations and Ripples Therefrom
• Estimation of Correlation Coefficients by Ellipsoidal Trimming
• Optimal design: Some geometrical aspects of D-optimality
• An algorithm for optimal designs on a design space
• Construction of Constrained Optimal Designs
• Asymptotic Properties of Non-Linear Least Squares Estimators
• Optimum Allocation in Linear Regression Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs