Some Algorithmic Aspects of the Theory of Optimal Designs

The approximate optimal design problem is treated as a constrained convex programming problem. A general class of optimal design algorithms is proposed from this point of view. Asymptotic convergence to optimal designs is also proved. Related problems like the implementability problem for the infinite support case and the general step-length algorithms are discussed.