arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新，休息一下吧，周末愉快~~
arXiv 0905.2646stat.COmath.STstat.MEstat.TH
收藏

最优设计一般算法的单调收敛性

Monotonic convergence of a general algorithm for computing optimal designs

Yaming Yu

备注：
Published in at http://dx.doi.org/10.1214/09-AOS761 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)
发表信息：
Annals of Statistics 2010, Vol. 38, No. 3, 1593-1606
阅读 PDF
arXiv 页面 ↗HTML 原文 ↗

摘要：

单调收敛建立了一个一般类的乘法算法介绍的Silvey，Titterington和Torsney [通讯。理论方法14（1978）1379- 1389]用于计算最优设计。Titterington的一个猜想[Appl. Stat. 27（1978）227- 234]被证实为结果。逻辑斯谛回归的最优设计被用作说明。

英文摘要：

Monotonic convergence is established for a general class of multiplicative algorithms introduced by Silvey, Titterington and Torsney [Comm. Statist. Theory Methods 14 (1978) 1379--1389] for computing optimal designs. A conjecture of Titterington [Appl. Stat. 27 (1978) 227--234] is confirmed as a consequence. Optimal designs for logistic regression are used as an illustration.

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

↑