Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 404

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

Meyer, Ruth K., Nachtsheim, Christopher J. · 1995 · Technometrics

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1080/00401706.1995.10485889

Cites

14 of 14 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 14 references

Research works printed but not linked: 14

  1. Bedford , S. J. “Reduction in Rework of Diesel Injectors,” . Fifth Symposium on Taguchi Methods . pp. 589 – 605 . Dearborn , MI : ASI Press .
  2. 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
  3. 10.1080/00401706.1988.10488438 · doi:10.1080/00401706.1988.10488438
  4. 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
  5. 10.1080/00401706.1980.10486161 · doi:10.1080/00401706.1980.10486161
  6. Koch , D. , Morris , W. T. , Nachtsheim , C. J. and Welch , W. J. 1991 . “Computer Software for Robust Product Design,” unpublished manuscript
  7. 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
  8. 10.1080/01966324.1988.10737244 · doi:10.1080/01966324.1988.10737244
  9. 10.1080/00401706.1974.10489175 · DOI
  10. 10.1080/00224065.1987.11979054 · doi:10.1080/00224065.1987.11979054
  11. Szelazek , G. B. 1987 . “Welding Brake Drum Balance Weights,” . In Fifth Symposium on Taguchi Methods , 573 – 587 . Dearborn , MI : ASI Press .
  12. 10.1080/00401706.1984.10487958 · doi:10.1080/00401706.1984.10487958
  13. 10.1080/00401706.1984.10487958 · doi:10.1080/00401706.1984.10487958
  14. 10.1111/j.2517-6161.1972.tb00896.x · doi:10.1111/j.2517-6161.1972.tb00896.x

Cited by

See all 404

Metadata

Authors
Meyer, R. K., & Nachtsheim, C. J.
Venue
Technometrics
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.