Improving updating rules in multiplicative algorithms for computing D-optimal designs
| dc.contributor.author | Dette, Holger | |
| dc.contributor.author | Pepelyshev, Andrey | |
| dc.date.accessioned | 2007-10-25T11:58:11Z | |
| dc.date.available | 2007-10-25T11:58:11Z | |
| dc.date.issued | 2007-10-25T11:58:11Z | |
| dc.description.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 a monotonicity 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 special cases. We provide numerical results demonstrating the efficiency of the proposed methods and discuss several extensions to other optimality criteria. | en |
| dc.identifier.uri | http://hdl.handle.net/2003/24796 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-14150 | |
| dc.language.iso | en | de |
| dc.subject | D-optimal design | en |
| dc.subject | Finite design space | en |
| dc.subject | Minimal covering ellipsoid | en |
| dc.subject | Multiplicative algorithm | en |
| dc.subject.ddc | 004 | |
| dc.title | Improving updating rules in multiplicative algorithms for computing D-optimal designs | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | en |
| dcterms.accessRights | open access |