arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0912.5467stat.MEmath.OCmath.STstat.TH
收藏

多响应试验最优设计的二阶锥规划计算

Computing Optimal Designs of multiresponse Experiments reduces to Second-Order Cone Programming

Guillaume Sagnol

摘要:

Elfving定理是最优试验设计理论中的一个重要结果,它给出了$c-$最优性的几何刻画。本文将这一定理推广到多响应试验的情形,证明了当试验次数有限时,多响应试验的最优设计$c-,A-,T-$和$D-$可以用二阶锥规划(SOCP)计算.此外,我们的SOCP方法可以处理设计问题,其中变量是受几个线性约束。我们给出两个证明这个推广Elfving的定理。一种是基于拉格朗日对偶技术,并依赖于这样一个事实,即半定规划(SDP)制定的多响应$c-$最优设计总是有一个解决方案,这是一个矩阵的秩$1$。因此,这一问题的复杂性逐渐消失。我们还研究了$c-$最优性的\emph{model robust}推广,Dette(1993)为此建立了Elfving型定理.我们表明,与相同的拉格朗日方法,这些模型的鲁棒设计可以有效地计算最小化的几何平均数下的一些规范约束。此外,我们表明,这个几何规划问题的最优性条件产生的Dette定理的多响应实验的情况下的扩展。当未知参数的数量是小的,或者当要估计的参数的线性函数的数量是小的,我们通过数值例子表明,我们的方法可以比经典的,最先进的算法快10至1000倍。

英文摘要:

Elfving's Theorem is a major result in the theory of optimal experimental design, which gives a geometrical characterization of $c-$optimality. In this paper, we extend this theorem to the case of multiresponse experiments, and we show that when the number of experiments is finite, $c-,A-,T-$ and $D-$optimal design of multiresponse experiments can be computed by Second-Order Cone Programming (SOCP). Moreover, our SOCP approach can deal with design problems in which the variable is subject to several linear constraints. We give two proofs of this generalization of Elfving's theorem. One is based on Lagrangian dualization techniques and relies on the fact that the semidefinite programming (SDP) formulation of the multiresponse $c-$optimal design always has a solution which is a matrix of rank $1$. Therefore, the complexity of this problem fades. We also investigate a \emph{model robust} generalization of $c-$optimality, for which an Elfving-type theorem was established by Dette (1993). We show with the same Lagrangian approach that these model robust designs can be computed efficiently by minimizing a geometric mean under some norm constraints. Moreover, we show that the optimality conditions of this geometric programming problem yield an extension of Dette's theorem to the case of multiresponse experiments. When the number of unknown parameters is small, or when the number of linear functions of the parameters to be estimated is small, we show by numerical examples that our approach can be between 10 and 1000 times faster than the classic, state-of-the-art algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑