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.
Original language | English (US) |
---|---|
Pages (from-to) | 271-277 |
Number of pages | 7 |
Journal | Technometrics |
Volume | 25 |
Issue number | 3 |
DOIs | |
State | Published - Aug 1983 |
Externally published | Yes |
Keywords
- Conjugate directions
- D-optimal
- Design augmentation
- Exchange algorithm
- Nonlinear optimization
- Simplex search