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

DOI10.1016/J.CSDA.2008.10.002MaRDI QIDQ961114zbMATHOpenAlexFDO

Authors Andrey Pepelyshev, Holger Dette, A. Zhigljavsky

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

Linear regression; mixed models (62J05) Optimal statistical designs (62K05)

Recommendations

• Multiplicative algorithms for computing optimum designs
• Multiplicative methods for computing \(D\)-optimal stratified designs of experiments
• Some refinements on Fedorov's algorithms for constructing D-optimal designs
• scientific article; zbMATH DE number 2059717
• Combined algorithm to compute D-optimal designs
• An algorithm for the simultaneous construction ofD-optimal experimental designs
• scientific article; zbMATH DE number 4166392
• Recent developments in D-optimal designs
• An Accelerated Sequential Algorithm for ProducingD-Optimal Designs

Cites work

• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3945143 (Why is no real title available?)
• scientific article; zbMATH DE number 3734989 (Why is no real title available?)
• scientific article; zbMATH DE number 1346777 (Why is no real title available?)
• scientific article; zbMATH DE number 1048003 (Why is no real title available?)
• scientific article; zbMATH DE number 800961 (Why is no real title available?)
• scientific article; zbMATH DE number 3393615 (Why is no real title available?)
• An algorithm for optimal designs on a design space
• Asymptotic Properties of Non-Linear Least Squares Estimators
• Bayesian experimental design: A review
• Construction of constrained optimal designs
• Construction of optimal designs using a clustering approach
• Estimation of Correlation Coefficients by Ellipsoidal Trimming
• General equivalence theory for optimum designs (approximate theory)
• Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
• Optimal Bayesian design applied to logistic regression experiments
• Optimal design: Some geometrical aspects of D-optimality
• Optimal weights for experimental designs on linearly independent support points
• Optimum Allocation in Linear Regression Theory
• Removing non-optimal support points in \(D\)-optimum design algorithms.
• The Equivalence of Two Extremum Problems
• W-iterations and ripples therefrom

Cited in

(31)

• D-optimal designs via a cocktail algorithm
• Multiplicative methods for computing \(D\)-optimal stratified designs of experiments
• Bayesian optimum designs for discriminating between models with any distribution
• Optimal designs for comparing curves
• Improving Convergence Rates of a Class of Algorithms
• Optimal Design of Experiments for Implicit Models
• Multiplicative algorithms for computing optimum designs
• \(K\)-optimal design via semidefinite programming and entropy optimization
• Construction of optimal designs using a clustering approach
• Near G-optimal Tchakaloff designs
• Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
• A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
• Algorithms for the construction of optimizing distributions
• A new monotonic algorithm for the \(E\)-optimal experiment design problem
• Optimal design for linear models with correlated observations
• `Nearly' universally optimal designs for models with correlated observations
• Adaptive grid semidefinite programming for finding optimal designs
• Miscellanea. Updating the average efficiency factor in  -designs
• Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
• Robust static designs for approximately specified nonlinear regression models
• Efficient algorithms for optimal designs with correlated observations in pharmacokinetics and dose-finding studies
• D-optimal designs based on the second-order least squares estimator
• Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments
• A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
• Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
• Some refinements on Fedorov's algorithms for constructing D-optimal designs
• Monotonic convergence of a general algorithm for computing optimal designs
• Efficient computational algorithm for optimal allocation in regression models
• Combined algorithm to compute D-optimal designs
• Submodularity and randomized rounding techniques for optimal experimental design
• Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q961114)