The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
Abstract
A technique for empirical optimisation is presented in which a sequence of experimental designs each in the form of a regular or irregular simplex is used, each simplex having all vertices but one in common with the preceding simplex, and being completed by one new point. Reasons for the choice of design are outlined, and a formal procedure given. The performance of the technique in the presence and absence of error is studied and it is shown (a) that in the presence of error the rate of advance is inversely proportional to the error standard deviation, so that replication of observations is not beneficial, and (b) that the “efficiency” of the technique appears to increase in direct proportion to the number of factors investigated. It is also noted that, since the direction of movement from each simplex is dependent solely on the ranking of the observations, the technique may be used even in circumstances when a response cannot be quantitatively assessed. Attention is drawn to the ease with which second-order designs having the minimum number of experimental points may be derived from a regular simplex, and a fitting procedure which avoids a direct matrix inversion is suggested. In a brief appendix one or two new rotatable designs derivable from a simplex are noted.
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
On the Experimental Attainment of Optimum Conditions
Box, G. E. P., & Wilson, K. B. (1951) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1951.tb00067.x · Cited by 4,464
On the Experimental Attainment of Optimum Conditions
Box, G. E. P., & Wilson, K. B. (1992) · Springer Series in Statistics · doi:10.1007/978-1-4612-4380-9_23 · Cited by 3,448
An Automatic Method for Finding the Greatest or Least Value of a Function
Rosenbrock, H. H. (1960) · The Computer Journal · doi:10.1093/comjnl/3.3.175 · Cited by 2,957
Multi-Factor Experimental Designs for Exploring Response Surfaces
Box, G. E. P., & Hunter, J. S. (1957) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177707047 · Cited by 1,430
Evolutionary Operation: A Method for Increasing Industrial Productivity
Box, G. E. P. (1957) · Applied Statistics · doi:10.2307/2985505 · Cited by 576
Cited by
Powell, M. J. D. (1994) · Advances in Optimization and Numerical Analysis · doi:10.1007/978-94-015-8330-5_4 · Cited by 1,369
Derivative-free optimization: a review of algorithms and comparison of software implementations
Rios, L. M., & Sahinidis, N. V. (2013) · Journal of Global Optimization · doi:10.1007/s10898-012-9951-y · Cited by 1,276
Statistical designs and response surface techniques for the optimization of chromatographic systems
Ferreira, S. L. C., Bruns, R. E., da Silva, E. G. P., dos Santos, W. N. L., Quintella, C. M., David, J. M., de Andrade, J. B., Breitkreitz, M. C., Jardim, I. C. S. F., & Neto, B. B. (2007) · Journal of Chromatography A · doi:10.1016/j.chroma.2007.03.051 · Cited by 616
Pattern Search Algorithms for Bound Constrained Minimization
Lewis, R. M., & Torczon, V. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623496300507 · Cited by 494
(2007) · Cited by 175
Metadata
- Authors
- Spendley, W., Hext, G. R., & Himsworth, F. R.
- Venue
- Technometrics
- Publisher
- Informa UK Limited
- Published
- 1962-11
- Volume
- 4
- Issue
- 4
- Pages
- 441-461
- ISSN
- 0040-1706 (ISSN-L)
- 1537-2723
- OpenAlex
- W2140691217
- Cited by
- 1,379
- References
- 5
- FWCI
- 4.60
- 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: Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation. https://app.cochat.ai/papers/10.1080/00401706.1962.10490033
- The paper
- Spendley, W., Hext, G. R., & Himsworth, F. R. (1962). Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation. Technometrics. https://doi.org/10.1080/00401706.1962.10490033
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.