arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1307.4953math.STmath.OCstat.TH
收藏

用混合整数二阶锥规划计算精确$D$ -最优设计

Computing exact $D$-optimal designs by mixed integer second-order cone programming

Guillaume Sagnol, Radoslav Harman

摘要:

设一个实验设计由一个$s$维向量$\mathbf {w}$表示,该向量的权重为非负分量.假设用于估计统计模型参数的$\mathbf {w}$的质量通过$D$ -最优性标准来测量,定义为信息矩阵$M(\mathbf {w})=\sum_{i=1}^sw_iA_iA_i^T$的行列式的$m$ th根,其中$A_i,i=1,\ldots,s$是具有$m$行的已知矩阵。本文证明了$D$ -最优性的判别准则是二阶锥可表示的。因此,二阶锥规划方法可用于计算权向量上具有任何线性约束系统的近似$D$ -最优设计。更重要的是,所提出的表征使我们能够计算出一个精确的$D$ -最优设计,这是可能的,由于高品质的分支和切割求解器专门解决混合整数二阶锥规划问题。我们的结果扩展到$D_K$ -最优性的标准的情况下,测量的质量$\mathbf {w}$的线性参数子系统的估计定义的满秩系数矩阵$K$。我们证明了其它一些广泛应用的准则也是二阶锥可表示的,例如$A$ -,$A_K$ -,$G$ -和$I$ -最优性准则.我们提出了几个数值例子证明所提出的方法的效率和普遍适用性。我们表明,在许多情况下,混合整数二阶锥规划方法使我们能够找到一个可证明的最佳精确设计,而标准算法系统地错过了最佳。

英文摘要:

Let the design of an experiment be represented by an $s$-dimensional vector $\mathbf {w}$ of weights with nonnegative components. Let the quality of $\mathbf {w}$ for the estimation of the parameters of the statistical model be measured by the criterion of $D$-optimality, defined as the $m$th root of the determinant of the information matrix $M(\mathbf {w})=\sum_{i=1}^sw_iA_iA_i^T$, where $A_i,i=1,\ldots,s$ are known matrices with $m$ rows. In this paper, we show that the criterion of $D$-optimality is second-order cone representable. As a result, the method of second-order cone programming can be used to compute an approximate $D$-optimal design with any system of linear constraints on the vector of weights. More importantly, the proposed characterization allows us to compute an exact $D$-optimal design, which is possible thanks to high-quality branch-and-cut solvers specialized to solve mixed integer second-order cone programming problems. Our results extend to the case of the criterion of $D_K$-optimality, which measures the quality of $\mathbf {w}$ for the estimation of a linear parameter subsystem defined by a full-rank coefficient matrix $K$. We prove that some other widely used criteria are also second-order cone representable, for instance, the criteria of $A$-, $A_K$-, $G$- and $I$-optimality. We present several numerical examples demonstrating the efficiency and general applicability of the proposed method. We show that in many cases the mixed integer second-order cone programming approach allows us to find a provably optimal exact design, while the standard heuristics systematically miss the optimum.

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

↑