Columnwise-pairwise algorithms with applications to the construction of supersaturated designs

William W. Li; C. F.Jeff Wu

doi:10.1080/00401706.1997.10485082

Columnwise-pairwise algorithms with applications to the construction of supersaturated designs

William W. Li, C. F.Jeff Wu

Supply Chain and Operations

Research output: Contribution to journal › Article › peer-review

147 Scopus citations

Abstract

Motivated by the construction of supersaturated designs, we develop a class of algorithms called columnwise-pairwise exchange algorithms. They differ from the k-exchange algorithms in two respects: (1) They exchange columns instead of rows of the design matrix, and (2) they employ a pairwise adjustment in the search for a “better” column. The proposed algorithms perform very well in the construction of supersaturated designs both for a single criterion and for multiple criteria. They are also applicable to the construction of designs that are not supersaturated.

Original language	English (US)
Pages (from-to)	171-179
Number of pages	9
Journal	Technometrics
Volume	39
Issue number	2
DOIs	https://doi.org/10.1080/00401706.1997.10485082
State	Published - May 1997

Bibliographical note

Funding Information:
We thank the associate editor and a referee for helpful comments. This researchw as supported by the Natural Sciences and Engineering Council of Canada at the Univer-sitv of Waterloo and the National Science Foundation grant DI& 9404300.

Keywords

CP algorithm
D-optima1 design
k-exchange algorithm

Access

10.1080/00401706.1997.10485082

OpenUrl availability

Full text

Cite this

@article{ccd4267956054670901ea59de7d98ff2,

title = "Columnwise-pairwise algorithms with applications to the construction of supersaturated designs",

abstract = "Motivated by the construction of supersaturated designs, we develop a class of algorithms called columnwise-pairwise exchange algorithms. They differ from the k-exchange algorithms in two respects: (1) They exchange columns instead of rows of the design matrix, and (2) they employ a pairwise adjustment in the search for a “better” column. The proposed algorithms perform very well in the construction of supersaturated designs both for a single criterion and for multiple criteria. They are also applicable to the construction of designs that are not supersaturated.",

keywords = "CP algorithm, D-optima1 design, k-exchange algorithm",

author = "Li, {William W.} and Wu, {C. F.Jeff}",

note = "Funding Information: We thank the associate editor and a referee for helpful comments. This researchw as supported by the Natural Sciences and Engineering Council of Canada at the Univer-sitv of Waterloo and the National Science Foundation grant DI& 9404300.",

year = "1997",

month = may,

doi = "10.1080/00401706.1997.10485082",

language = "English (US)",

volume = "39",

pages = "171--179",

journal = "Technometrics",

issn = "0040-1706",

publisher = "American Statistical Association",

number = "2",

}

TY - JOUR

T1 - Columnwise-pairwise algorithms with applications to the construction of supersaturated designs

AU - Li, William W.

AU - Wu, C. F.Jeff

N1 - Funding Information: We thank the associate editor and a referee for helpful comments. This researchw as supported by the Natural Sciences and Engineering Council of Canada at the Univer-sitv of Waterloo and the National Science Foundation grant DI& 9404300.

PY - 1997/5

Y1 - 1997/5

N2 - Motivated by the construction of supersaturated designs, we develop a class of algorithms called columnwise-pairwise exchange algorithms. They differ from the k-exchange algorithms in two respects: (1) They exchange columns instead of rows of the design matrix, and (2) they employ a pairwise adjustment in the search for a “better” column. The proposed algorithms perform very well in the construction of supersaturated designs both for a single criterion and for multiple criteria. They are also applicable to the construction of designs that are not supersaturated.

AB - Motivated by the construction of supersaturated designs, we develop a class of algorithms called columnwise-pairwise exchange algorithms. They differ from the k-exchange algorithms in two respects: (1) They exchange columns instead of rows of the design matrix, and (2) they employ a pairwise adjustment in the search for a “better” column. The proposed algorithms perform very well in the construction of supersaturated designs both for a single criterion and for multiple criteria. They are also applicable to the construction of designs that are not supersaturated.

KW - CP algorithm

KW - D-optima1 design

KW - k-exchange algorithm

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

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

U2 - 10.1080/00401706.1997.10485082

DO - 10.1080/00401706.1997.10485082

M3 - Article

AN - SCOPUS:0031144310

SN - 0040-1706

VL - 39

SP - 171

EP - 179

JO - Technometrics

JF - Technometrics

IS - 2

ER -

Columnwise-pairwise algorithms with applications to the construction of supersaturated designs

Abstract

Bibliographical note

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this