Optimal Regular Graph Designs
Computation
2015-04-20 v2
Abstract
A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many optimality results and, if the number of blocks is large enough, they are A- and D-optimal. We present the results of an exact computer search for the best regular graph designs in large systems for up to 20 points, k<=r<=10 and r(k-1)-(v-1)[r(k-1)/(v-1)]<=9.
Keywords
Cite
@article{arxiv.1502.05287,
title = {Optimal Regular Graph Designs},
author = {Sera Aylin Cakiroglu},
journal= {arXiv preprint arXiv:1502.05287},
year = {2015}
}