Improving updating rules in multiplicative algorithms for computing D-optimal designs
A class of multiplicative algorithms for computing D-optimal designs for regression models on a finite design space is discussed and a monotonicity result for a sequence of determinants obtained by the iterations is proved. As a consequence the convergence of the sequence of designs to the D-optimal design is established. The class of algorithms is indexed by a real parameter and contains two algorithms considered previously as special cases. Numerical results are provided to demonstrate the efficiency of the proposed methods. Finally, several extensions to other optimality criteria are discussed.
Year of publication: |
2008
|
---|---|
Authors: | Dette, Holger ; Pepelyshev, Andrey ; Zhigljavsky, Anatoly |
Published in: |
Computational Statistics & Data Analysis. - Elsevier, ISSN 0167-9473. - Vol. 53.2008, 2, p. 312-320
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Improving updating rules in multiplicativealgorithms for computing D-optimal designs
Dette, Holger, (2007)
-
‘Nearly’ universally optimal designs for models with correlated observations
Dette, Holger, (2014)
-
Improving updating rules in multiplicativealgorithms for computing D-optimal designs
Dette, Holger, (2007)
- More ...