The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A New Method of Constrained Optimization and a Comparison With Other Methods
Abstract
A new method for finding the maximum of a general non-linear function of several variables within a constrained region is described, and shown to be efficient compared with existing methods when the required optimum lies on one or more constraints. The efficacy of using effective constraints to eliminate variables is demonstrated, and a program to achieve this easily and automatically is described. Finally, the performance of the new method (the “Complex” method) with unconstrained problems, is compared with those of the Simplex method, from which it was evolved, and Rosenbrock's method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
A Rapidly Convergent Descent Method for Minimization
Fletcher, R., & Powell, M. J. D. (1963) · The Computer Journal · doi:10.1093/comjnl/6.2.163 · Cited by 4,583
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
The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
Rosen, J. B. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108011 · Cited by 1,190
Variable Metric Method for Minimization
Davidon, W. C. (1991) · SIAM Journal on Optimization · doi:10.1137/0801001 · Cited by 892
The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
Rosen, J. B. (1961) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0109044 · Cited by 520
The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
Carroll, C. W. (1961) · Operations Research · doi:10.1287/opre.9.2.169 · Cited by 313
Cited by
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
Kolda, T. G., Lewis, R. M., & Torczon, V. (2003) · SIAM Review · doi:10.1137/s003614450242889 · Cited by 1,653
An introduction to genetic algorithms
Deb, K. (1999) · Sadhana · doi:10.1007/bf02823145 · Cited by 1,176
Optimization Concepts and Applications in Engineering
Belegundu, A. D., & Chandrupatla, T. R. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511975905 · Cited by 555
Development of origin–destination matrices using mobile phone call data
Iqbal, M. S., Choudhury, C. F., Wang, P., & González, M. C. (2014) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2014.01.002 · Cited by 507
Box, M. J. (1966) · The Computer Journal · doi:10.1093/comjnl/9.1.67 · Cited by 372
Self-citation
Metadata
- Authors
- Box, M. J.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 1965-04-01
- Volume
- 8
- Issue
- 1
- Pages
- 42-52
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W2163918103
- Cited by
- 1,302
- References
- 7
- FWCI
- 3.23
- 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
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.