Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum Designs

Abstract

We develop a family of computer search methods for finding optimum designs, that generalize and improve upon Mitchell's exchange and DETMAK algorithms. Our emphasis is on time- and space-saving considerations that permit us to handle larger problems, or to run each search “try” for the optimum more rapidly, than was previously possible. This last means that more tries can be attempted for a given total cost, with consequent greater chance of finding an optimum or near-optimum design. Indeed, we have found a number of new optimum or improved designs using these methods. For k = 6 to 12 parameters and with n observations and k ≤ n ≤ 2k, our methods are typically 15 to 50 times faster than DETMAX (more as n and k increase), with comparable success rates. Numerical studies in linear and quadratic regression examples treat also the effect of amount of initial randomization on the success of a try.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 116 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.