The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
Abstract
We describe the cyclic coordinate-exchange algorithm for constructing D-optimal and linear-optimal experimental designs. The algorithm uses a variant of the Gauss-Southwell cyclic coordinate-descent algorithm within the k-exchange algorithm to achieve substantive reductions in required computing. Among its advantages are the following: Candidate sets, which grow exponentially in the number of factors, need not be explicitly constructed or enumerated. Convex design spaces (or mixed convex by discrete design spaces) are handled directly, without the need for sophisticated nonlinear programming routines or candidate-set adjustment. For design problems having 10 or more factors, the reductions in execution time are typically two or more orders of magnitude when compared to standard candidateset- based procedures such as k exchange, yet the designs produced exhibit no loss of efficiency.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632
Introduction to linear and nonlinear programming
Polak, E. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100535 · Cited by 2,100
Fedorov, V. V., Studden, W. J., & Klimko, E. M. (1972) · Cited by 2,092
Introduction to linear and nonlinear programming
Luenberger, D. G. (1973) · Medical Entomology and Zoology · Cited by 1,915
Theory of Optimal Experiments.
Herzberg, A. M., Wynn, H. P., Fedorov, V. V., Studden, W. J., & Klimko, E. M. (1972) · Biometrika · doi:10.2307/2334826 · Cited by 1,897
Matrix Algebra Useful for Statistics
Schmee, J. (1985) · Technometrics · doi:10.1080/00401706.1985.10488022 · Cited by 775
Matrix Algebra Useful for Statistics.
Green, P. J., & Searle, S. R. (1983) · Biometrics · doi:10.2307/2531366 · Cited by 528
An Algorithm for the Construction of "D-Optimal" Experimental Designs
Mitchell, T. J. (2000) · Technometrics · doi:10.2307/1271431 · Cited by 421
A Comparison of Algorithms for Constructing Exact D-Optimal Designs
Cook, R. D., & Nachtrheim, C. J. (1980) · Technometrics · doi:10.1080/00401706.1980.10486162 · Cited by 408
Factorial Designs, the |X′X| Criterion, and Some Related Matters
Box, M. J., & Draper, N. R. (1971) · Technometrics · doi:10.1080/00401706.1971.10488845 · Cited by 221
Research works printed but not linked: 14
- Bedford , S. J. “Reduction in Rework of Diesel Injectors,” . Fifth Symposium on Taguchi Methods . pp. 589 – 605 . Dearborn , MI : ASI Press .
- Cook , R. D. and Nachtsheim , C. J. 1982 . “An Analysis of the k-exchange Algorithm,” , University of Minnesota, Dept. of Operations and Management Science . technical report
- 10.1080/00401706.1988.10488438 · doi:10.1080/00401706.1988.10488438
- 10.1002/1520-6750(199004)37:2<299::AID-NAV3220370208>3.0.CO;2-M · doi:10.1002/1520-6750(199004)37:2<299::aid-nav3220370208>3.0.co;2-m
- 10.1080/00401706.1980.10486161 · doi:10.1080/00401706.1980.10486161
- Koch , D. , Morris , W. T. , Nachtsheim , C. J. and Welch , W. J. 1991 . “Computer Software for Robust Product Design,” unpublished manuscript
- Meyer , R. K. 1989 . “Contributions to the Construction of Exact D- optimal Experimental Designs,” , University of Minnesota, Operations and Management Science Dept. . unpublished Ph.D. thesis
- 10.1080/01966324.1988.10737244 · doi:10.1080/01966324.1988.10737244
- 10.1080/00401706.1974.10489175 · DOI
- 10.1080/00224065.1987.11979054 · doi:10.1080/00224065.1987.11979054
- Szelazek , G. B. 1987 . “Welding Brake Drum Balance Weights,” . In Fifth Symposium on Taguchi Methods , 573 – 587 . Dearborn , MI : ASI Press .
- 10.1080/00401706.1984.10487958 · doi:10.1080/00401706.1984.10487958
- 10.1080/00401706.1984.10487958 · doi:10.1080/00401706.1984.10487958
- 10.1111/j.2517-6161.1972.tb00896.x · doi:10.1111/j.2517-6161.1972.tb00896.x
Cited by
A Class of Three-Level Designs for Definitive Screening in the Presence of Second-Order Effects
Jones, B., & Nachtsheim, C. J. (2011) · Journal of Quality Technology · doi:10.1080/00224065.2011.11917841 · Cited by 483
Self-citationD-optimal design of split-split-plot experiments
Jones, B., & Goos, P. (2009) · Biometrika · doi:10.1093/biomet/asn070 · Cited by 47
Mylona, K., Goos, P., & Jones, B. (2014) · Technometrics · doi:10.1080/00401706.2013.818579 · Cited by 31
Mylona, K., Gilmour, S. G., & Goos, P. (2020) · Technometrics · doi:10.1080/00401706.2019.1595153 · Cited by 13
DP-Optimality in Terms of Multiple Criteria and Its Application to the Split-Plot Design
Cao, Y., Wulff, S. S., & Robinson, T. J. (2017) · Journal of Quality Technology · doi:10.1080/00224065.2017.11918183 · Cited by 9
Metadata
- Authors
- Meyer, R. K., & Nachtsheim, C. J.
- Venue
- Technometrics
- Publisher
- Informa UK Limited
- Published
- 1995-02
- Volume
- 37
- Issue
- 1
- Pages
- 60-69
- ISSN
- 0040-1706 (ISSN-L)
- 1537-2723
- OpenAlex
- W2030289221
- Cited by
- 404
- References
- 14
- FWCI
- 1.36
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs. https://app.cochat.ai/papers/10.1080/00401706.1995.10485889
- The paper
- Meyer, R. K., & Nachtsheim, C. J. (1995). The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs. Technometrics. https://doi.org/10.1080/00401706.1995.10485889
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.