Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
Authors:
Open Access
- 11 November 2009
- journal article
- Published by Walter de Gruyter GmbH in Mathematica Slovaca
- Vol. 59 (6) , 693-704
Abstract
In the paper we solve the problem of D ℋ-optimal design on a discrete experimental domain, which is formally equivalent to maximizing determinant on the convex hull of a finite set of positive semidefinite matrices. The problem of D ℋ-optimality covers many special design settings, e.g., the D-optimal experimental design for multivariate regression models. For D ℋ-optimal designs we prove several theorems generalizing known properties of standard D-optimality. Moreover, we show that D ℋ-optimal designs can be numerically computed using a multiplicative algorithm, for which we give a proof of convergence. We illustrate the results on the problem of D-optimal augmentation of independent regression trials for the quadratic model on a rectangular grid of points in the plane.Keywords
This publication has 4 references indexed in Scilit:
- Improvements on removing nonoptimal support points in -optimum design algorithmsStatistics & Probability Letters, 2007
- Matrix Theory1999
- A Moment Inequality and Monotonicity of an Algorithm1983
- The Equivalence of Two Extremum ProblemsCanadian Journal of Mathematics, 1960