Some guidelines for constructing exact d-optimal designs on convex design spaces

Mark E. Johnson, Christopher J Nachtsheim

Research output: Contribution to journalArticle

86 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)271-277
Number of pages7
JournalTechnometrics
Volume25
Issue number3
DOIs
StatePublished - Jan 1 1983
Externally publishedYes

Fingerprint

Exact Designs
D-optimal Design
Augmentation
Exchange Algorithm
Optimization Methods
Recommendations
Design
Optimal design

Keywords

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

Cite this

Some guidelines for constructing exact d-optimal designs on convex design spaces. / Johnson, Mark E.; Nachtsheim, Christopher J.

In: Technometrics, Vol. 25, No. 3, 01.01.1983, p. 271-277.

Research output: Contribution to journalArticle

@article{9bece006afac4c8b8b1eb4e14dbc29d6,
title = "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.",
keywords = "Conjugate directions, D-optimal, Design augmentation, Exchange algorithm, Nonlinear optimization, Simplex search",
author = "Johnson, {Mark E.} and Nachtsheim, {Christopher J}",
year = "1983",
month = "1",
day = "1",
doi = "10.1080/00401706.1983.10487880",
language = "English (US)",
volume = "25",
pages = "271--277",
journal = "Technometrics",
issn = "0040-1706",
publisher = "American Statistical Association",
number = "3",

}

TY - JOUR

T1 - Some guidelines for constructing exact d-optimal designs on convex design spaces

AU - Johnson, Mark E.

AU - Nachtsheim, Christopher J

PY - 1983/1/1

Y1 - 1983/1/1

N2 - 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.

AB - 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.

KW - Conjugate directions

KW - D-optimal

KW - Design augmentation

KW - Exchange algorithm

KW - Nonlinear optimization

KW - Simplex search

UR - http://www.scopus.com/inward/record.url?scp=0020799674&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020799674&partnerID=8YFLogxK

U2 - 10.1080/00401706.1983.10487880

DO - 10.1080/00401706.1983.10487880

M3 - Article

VL - 25

SP - 271

EP - 277

JO - Technometrics

JF - Technometrics

SN - 0040-1706

IS - 3

ER -