Improving updating rules in multiplicative algorithms for computing D-optimal designs
From MaRDI portal
Publication:961114
DOI10.1016/J.CSDA.2008.10.002zbMATH Open1231.62141OpenAlexW2126439981MaRDI QIDQ961114FDOQ961114
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
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
- Recent developments in D-optimal designs
- An Accelerated Sequential Algorithm for ProducingD-Optimal Designs
Cites Work
- Bayesian experimental design: A review
- Optimum Allocation in Linear Regression Theory
- General equivalence theory for optimum designs (approximate theory)
- Construction of optimal designs using a clustering approach
- The Equivalence of Two Extremum Problems
- Estimation of Correlation Coefficients by Ellipsoidal Trimming
- An algorithm for optimal designs on a design space
- Title not available (Why is that?)
- Asymptotic Properties of Non-Linear Least Squares Estimators
- Title not available (Why is that?)
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Optimal Bayesian design applied to logistic regression experiments
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal design: Some geometrical aspects of D-optimality
- Optimal weights for experimental designs on linearly independent support points
- Title not available (Why is that?)
- Title not available (Why is that?)
- W-iterations and ripples therefrom
- Construction of constrained optimal designs
- Removing non-optimal support points in \(D\)-optimum design algorithms.
Cited In (31)
- Multiplicative methods for computing \(D\)-optimal stratified designs of experiments
- Multiplicative algorithms for computing optimum designs
- Submodularity and randomized rounding techniques for optimal experimental design
- Bayesian optimum designs for discriminating between models with any distribution
- Algorithms for the construction of optimizing distributions
- Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
- 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 designs for comparing curves
- A new monotonic algorithm for the \(E\)-optimal experiment design problem
- A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
- Miscellanea. Updating the average efficiency factor in -designs
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- Optimal design for linear models with correlated observations
- `Nearly' universally optimal designs for models with correlated observations
- Combined algorithm to compute D-optimal designs
- Improving Convergence Rates of a Class of Algorithms
- \(K\)-optimal design via semidefinite programming and entropy optimization
- Some refinements on Fedorov's algorithms for constructing D-optimal designs
- D-optimal designs via a cocktail algorithm
- Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
- Near G-optimal Tchakaloff designs
- Robust static designs for approximately specified nonlinear regression models
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
- Monotonic convergence of a general algorithm for computing optimal designs
- D-optimal designs based on the second-order least squares estimator
- Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments
- Optimal Design of Experiments for Implicit Models
- Efficient computational algorithm for optimal allocation in regression models
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)
