A procedure for finding an improved upper bound on the number of optimal design points

Seung Won Hyun, Min Yang, Nancy Flournoy

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Knowing an upper bound on the number of optimal design points greatly simplifies the search for an optimal design. Carathéodory's Theorem is commonly used to identify an upper bound. However, the upper bound from Carathéodory's Theorem is relatively loose when there are three or more parameters in the model. In this paper, an alternative approach of finding a sharper upper bound for classical optimality criteria is proposed. Examples are given to demonstrate how to use the new approach.

Original languageEnglish (US)
Pages (from-to)276-282
Number of pages7
JournalComputational Statistics and Data Analysis
Volume58
Issue number1
DOIs
StatePublished - Feb 1 2013

Fingerprint

Upper bound
Optimality Criteria
Theorem
Simplify
Optimal design
Alternatives
Demonstrate
Model

Keywords

  • Carathéodory's theorem
  • Cardinality of design
  • Experimental design
  • Nonlinear regression

ASJC Scopus subject areas

  • Statistics and Probability
  • Computational Mathematics
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this

A procedure for finding an improved upper bound on the number of optimal design points. / Hyun, Seung Won; Yang, Min; Flournoy, Nancy.

In: Computational Statistics and Data Analysis, Vol. 58, No. 1, 01.02.2013, p. 276-282.

Research output: Contribution to journalArticle

@article{25aca5155ce64360939765bd2faac67a,
title = "A procedure for finding an improved upper bound on the number of optimal design points",
abstract = "Knowing an upper bound on the number of optimal design points greatly simplifies the search for an optimal design. Carath{\'e}odory's Theorem is commonly used to identify an upper bound. However, the upper bound from Carath{\'e}odory's Theorem is relatively loose when there are three or more parameters in the model. In this paper, an alternative approach of finding a sharper upper bound for classical optimality criteria is proposed. Examples are given to demonstrate how to use the new approach.",
keywords = "Carath{\'e}odory's theorem, Cardinality of design, Experimental design, Nonlinear regression",
author = "Hyun, {Seung Won} and Min Yang and Nancy Flournoy",
year = "2013",
month = "2",
day = "1",
doi = "10.1016/j.csda.2012.08.012",
language = "English (US)",
volume = "58",
pages = "276--282",
journal = "Computational Statistics and Data Analysis",
issn = "0167-9473",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - A procedure for finding an improved upper bound on the number of optimal design points

AU - Hyun, Seung Won

AU - Yang, Min

AU - Flournoy, Nancy

PY - 2013/2/1

Y1 - 2013/2/1

N2 - Knowing an upper bound on the number of optimal design points greatly simplifies the search for an optimal design. Carathéodory's Theorem is commonly used to identify an upper bound. However, the upper bound from Carathéodory's Theorem is relatively loose when there are three or more parameters in the model. In this paper, an alternative approach of finding a sharper upper bound for classical optimality criteria is proposed. Examples are given to demonstrate how to use the new approach.

AB - Knowing an upper bound on the number of optimal design points greatly simplifies the search for an optimal design. Carathéodory's Theorem is commonly used to identify an upper bound. However, the upper bound from Carathéodory's Theorem is relatively loose when there are three or more parameters in the model. In this paper, an alternative approach of finding a sharper upper bound for classical optimality criteria is proposed. Examples are given to demonstrate how to use the new approach.

KW - Carathéodory's theorem

KW - Cardinality of design

KW - Experimental design

KW - Nonlinear regression

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

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

U2 - 10.1016/j.csda.2012.08.012

DO - 10.1016/j.csda.2012.08.012

M3 - Article

AN - SCOPUS:84869079242

VL - 58

SP - 276

EP - 282

JO - Computational Statistics and Data Analysis

JF - Computational Statistics and Data Analysis

SN - 0167-9473

IS - 1

ER -