Abstract
The paper extends the result of Harman and Pronzato [Stat. & Prob. Lett., 77:90--94, 2007], which corresponds to , to all strictly concave criteria in Kiefer's -class. Let be any design on a compact set with a nonsingular information matrix $\Mb(ξ)$, and let be the maximum of the directional derivative over all . We show that any support point of a -optimal design satisfies the inequality $F_{ϕ_p}(ξ,x_*) \geq h_p[\Mb(ξ),δ]$, where the bound $h_p[\Mb(ξ),δ]$ is easily computed: it requires the determination of the unique root of a simple univariate equation (polynomial when is integer) in a given interval. The construction can be used to accelerate algorithms for -optimal design and is illustrated on an example with -optimal design.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.