Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/25010
Authors: 
Dette, Holger
Pepelyshev, Andrey
Zhigljavsky, Anatoly
Year of Publication: 
2007
Series/Report no.: 
Technical Report // Sonderforschungsbereich 475, Komplexitätsreduktion in Multivariaten Datenstrukturen, Universität Dortmund 2007,28
Abstract: 
In this paper we discuss a class of multiplicative algorithms for computing D-optimal designs for regression models on a finite design space. We prove amonotonicity result for a sequence of determinants obtained by the iterations,and as a consequence the procedure yields a sequence of designs converging to the D-optimal design. The class of algorithms is indexed by a real parameter and contains two algorithms considered by Titterington (1976, 1978) as specialcases. We provide numerical results demonstrating the efficiency of the proposed methods and discuss several extensions to other optimality criteria.
Subjects: 
D-optimal design
finite design space
multiplicative algorithm
minimal covering ellipsoid
Document Type: 
Working Paper

Files in This Item:
File
Size
165.78 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.