arXiv · 0706.4394
Improvements on removing non-optimal support points in D-optimum design algorithms
Abstract
We improve the inequality used in Pronzato [2003. Removing non-optimal support points in D-optimum design algorithms. Statist. Probab. Lett. 63, 223-228] to remove points from the design space during the search for a $D$-optimum design. Let $ξ$ be any design on a compact space $\mathcal{X} \subset \mathbb{R}^m$ with a nonsingular information matrix, and let $m+ε$ be the maximum of the variance function $d(ξ,\mathbf{x})$ over all $\mathbf{x} \in \mathcal{X}$. We prove that any support point $\mathbf{x}_{*}$ of a $D$-optimum design on $\mathcal{X}$ must satisfy the inequality $d(ξ,\mathbf{x}_{*}) \geq m(1+ε/2-\sqrt{ε(4+ε-4/m)}/2)$. We show that this new lower bound on $d(ξ,\mathbf{x}_{*})$ is, in a sense, the best possible, and how it can be used to accelerate algorithms for $D$-optimum design.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Radoslav Harman, Luc Pronzato. 2007-06-29. Improvements on removing non-optimal support points in D-optimum design algorithms. https://arxiv.org/abs/0706.4394
Cite the original work for its findings. Save a collection to share your selection of sources.