Arbeitspapier

Improving updating rules in multiplicativealgorithms for computing D-optimal designs

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.

Language
Englisch

Bibliographic citation
Series: Technical Report ; No. 2007,28

Subject
D-optimal design
finite design space
multiplicative algorithm
minimal covering ellipsoid
Regression
Heuristisches Verfahren
Robustes Verfahren
Theorie

Event
Geistige Schöpfung
(who)
Dette, Holger
Pepelyshev, Andrey
Zhigljavsky, Anatoly
Event
Veröffentlichung
(who)
Universität Dortmund, Sonderforschungsbereich 475 - Komplexitätsreduktion in Multivariaten Datenstrukturen
(where)
Dortmund
(when)
2007

Handle
Last update
10.03.2025, 11:44 AM CET

Data provider

This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.

Object type

  • Arbeitspapier

Associated

  • Dette, Holger
  • Pepelyshev, Andrey
  • Zhigljavsky, Anatoly
  • Universität Dortmund, Sonderforschungsbereich 475 - Komplexitätsreduktion in Multivariaten Datenstrukturen

Time of origin

  • 2007

Other Objects (12)