Computing D-Optimal solutions for huge-scale linear and quadratic response-surface models

Abstract: We consider algorithmic approaches to the D-optimality problem for cases where the input design matrix is large and highly structured, in particular implicitly specified as a full quadratic or linear response-surface model in several levels of several factors. Using row generation techniques of mathematical optimization, in the context of discrete local-search and continuous relaxation aimed at branch-and-bound solution, we are able to design practical algorithms.