Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces

Abstract

Some problems unique to the construction of N-point D-optimal designs on convex design spaces are considered. Multiple-point augmentation and exchange algorithms are shown to be more costly and less efficient than the analogous single-point procedures. Moreover, some recommendations for improving single-point methods are given. Finally, empirical evidence is found that supports the Galil and Kiefer option for constructing initial designs and Powell's optimization method for design augmentation.

KEY WORDS:

• D-optimal
• Exchange algorithm
• Nonlinear optimization
• Simplex search
• Conjugate directions
• Design augmentation