Cover Image

Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs

We study a class of multiplicative algorithms introduced by Silvey et al. (1978) for computing D-optimal designs. Strict monotonicity is established for a variant considered by Titterington (1978). A formula for the rate of convergence is also derived. This is used to explain why modifications considered by Titterington (1978) and Dette et al. (2008) usually converge faster.
Year of publication:
2010
Authors: Yu, Yaming
Published in:
Computational Statistics & Data Analysis. - Elsevier, ISSN 0167-9473. - Vol. 54.2010, 6, p. 1419-1425
Publisher: Elsevier
Subject: D-optimality Experimental design Multiplicative algorithm
Type of publication: Article
Source:
Persistent link: https://ebvufind01.dmz1.zbw.eu/10008550858
Similar items by person