The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
Abstract
The performances of eight current methods for unconstrained optimization are evaluated using a set of test problems with up to twenty variables. The use of optimization techniques in the solution of simultaneous non-linear equations is also discussed. Finally transformations whereby inequality constraints of certain forms can be eliminated from the formulation of an optimization problem are described, and examples of their use compared with other methods for handling such constraints.
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
Function minimization by conjugate gradients
Fletcher, R. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.149 · Cited by 4,939
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632
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
Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
Spendley, W., Hext, G. R., & Himsworth, F. R. (1962) · Technometrics · doi:10.1080/00401706.1962.10490033 · Cited by 1,379
A New Method of Constrained Optimization and a Comparison With Other Methods
Box, M. J. (1965) · The Computer Journal · doi:10.1093/comjnl/8.1.42 · Cited by 1,302
Self-citationVariable Metric Method for Minimization
Davidon, W. C. (1991) · SIAM Journal on Optimization · doi:10.1137/0801001 · Cited by 892
A Method for Minimizing a Sum of Squares of Non-Linear Functions Without Calculating Derivatives
Powell, M. J. D. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.303 · Cited by 759
DESIGN OF EXPERIMENTS IN NON-LINEAR SITUATIONS
BOX, G. E. P., & LUCAS, H. L. (1959) · Biometrika · doi:10.1093/biomet/46.1-2.77 · Cited by 738
Cited by
Conditioning of quasi-Newton methods for function minimization
Shanno, D. F. (1970) · Mathematics of Computation · doi:10.1090/s0025-5718-1970-0274029-x · Cited by 3,872
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
A Projection Pursuit Algorithm for Exploratory Data Analysis
Friedman, J. H., & Tukey, J. W. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.224051 · Cited by 1,652
Convergence Conditions for Ascent Methods
Wolfe, P. (1969) · SIAM Review · doi:10.1137/1011036 · Cited by 1,106
An Adaptive Nonlinear Least-Squares Algorithm
Dennis, J. E., Gay, D. M., & Walsh, R. E. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355958.355965 · Cited by 930
A method for satellite identification of surface temperature fields of subpixel resolution
Dozier, J. (1981) · Remote Sensing of Environment · doi:10.1016/0034-4257(81)90021-3 · Cited by 696
Direct search methods: then and now
Lewis, R. M., Torczon, V., & Trosset, M. W. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00423-4 · Cited by 648
Exponential analysis in physical phenomena
Istratov, A. A., & Vyvenko, O. F. (1999) · Review of Scientific Instruments · doi:10.1063/1.1149581 · Cited by 615
Algorithms for the Solution of the Nonlinear Least-Squares Problem
Gill, P. E., & Murray, W. (1978) · SIAM Journal on Numerical Analysis · doi:10.1137/0715063 · Cited by 556
A program package for simulation and parameter estimation in pharmacokinetic systems
D'argenio, D. Z., & Schumitzky, A. (1979) · Computer Programs in Biomedicine · doi:10.1016/0010-468x(79)90025-4 · Cited by 471
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
The Scope and Limitations of Curve Fitting
Maddams, W. F. (1980) · Applied Spectroscopy · doi:10.1366/0003702804730312 · Cited by 392
Brown, K. M., & Dennis, J. E. (1971) · Numerische Mathematik · doi:10.1007/bf01404679 · Cited by 370
Dud, A Derivative-Free Algorithm for Nonlinear Least Squares
Ralston, M. L., & Jennrich, R. I. (1978) · Technometrics · doi:10.1080/00401706.1978.10489610 · Cited by 364
Comparison of Gradient Methods for the Solution of Nonlinear Parameter Estimation Problems
Bard, Y. (1970) · SIAM Journal on Numerical Analysis · doi:10.1137/0707011 · Cited by 267
Exponential-sum fitting of radiative transmission functions
Wiscombe, W. J., & Evans, J. W. (1977) · Journal of Computational Physics · doi:10.1016/0021-9991(77)90031-6 · Cited by 263
D-Optimality for Regression Designs: A Review
John, R. C. S., & Draper, N. R. (1975) · Technometrics · doi:10.1080/00401706.1975.10489266 · Cited by 254
Metadata
- Authors
- Box, M. J.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 1966-05-01
- Volume
- 9
- Issue
- 1
- Pages
- 67-77
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W2318609557
- Cited by
- 372
- References
- 13
- FWCI
- 15.75
- 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.