Answers are grounded in this paper and cite their sources.
An extremely efficient algorithm is presented for generating D-optimal designs. It is shown that the underlying set function of the sequential design algorithm is submodular and thus the so-called accelerated greedy algorithm may be applied to this problem. While the new algorithm’s statistical basis is identical to that of the Wynn and Federov algorithm, it requires significantly fewer function evaluations. The new algorithm is particularly useful when no prior information concerning the structure of the optimal design is available.
No takes yet. Share an insight, caveat, or question.
Robertazzi et al. (1989) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: