Rates of convergence for random approximations of convex sets
Rates of convergence for random approximations of convex sets
复制标题
凸集随机近似的收敛率
DOI:
10.2307/1428063
复制
发表时间:
1996
影响因子:
1.2
通讯作者:
Gunther Walther
中科院分区:
文献类型:
--
作者:
L. Dümbgen;Gunther Walther
The Hausdorff distance between a compact convex set K ⊂ ℝd and random sets is studied. Basic inequalities are derived for the case of being a convex subset of K. If applied to special sequences of such random sets, these inequalities yield rates of almost sure convergence. With the help of duality considerations these results are extended to the case of being the intersection of a random family of halfspaces containing K.