The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
Open accessAbstract
A new global optimization algorithm for functions of continuous variables is presented, derived from the “Simulated Annealing” algorithm recently introduced in combinatorial optimization. The algorithm is essentially an iterative random search procedure with adaptive moves along the coordinate directions. It permits uphill moves under the control of a probabilistic criterion, thus tending to avoid the first local minima encountered. The algorithm has been tested against the Nelder and Mead simplex method and against a version of Adaptive Random Search. The test functions were Rosenbrock valleys and multiminima functions in 2,4, and 10 dimensions. The new method proved to be more reliable than the others, being always able to find the optimum, or at least a point very close to it. It is quite costly in term of function evaluations, but its cost can be predicted in advance, depending only slightly on the starting point.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
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
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
`` Direct Search'' Solution of Numerical and Statistical Problems
Hooke, R., & Jeeves, T. A. (1961) · Journal of the ACM · doi:10.1145/321062.321069 · Cited by 4,254
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
A controlled random search procedure for global optimisation
Price, W. L. (1977) · The Computer Journal · doi:10.1093/comjnl/20.4.367 · Cited by 323
Concepts of scale in simulated annealing
White, S. R. (1984) · AIP Conference Proceedings · doi:10.1063/1.34823 · Cited by 228
A general-purpose global optimizer: Implimentation and applications
Pronzato, L., Walter, E., Alain Venot, A., & Lebruchec, J.-F. (1984) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(84)90105-8 · Cited by 117
Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93
(1993) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd.1993.393415 · Cited by 103
Some Algorithms for Minimizing a Function of Several Variables
Shah, B. V., Buehler, R. J., & Kempthorne, O. (1964) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0112007 · Cited by 94
A global optimization algorithm using adaptive random search
Masri, S. F., Bekey, G. A., & Safford, F. B. (1980) · Applied Mathematics and Computation · doi:10.1016/0096-3003(80)90027-2 · Cited by 92
A Simulation Test Approach to the Evaluation of Nonlinear Optimization Algorithms
Hillstrom, K. E. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355759.355760 · Cited by 74
Cited by
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Learning long-term dependencies with gradient descent is difficult
Bengio, Y., Simard, P., & Frasconi, P. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279181 · Cited by 8,542
“We implemented the simulated annealing algorithm presented in [6] for optimizing functions of continuous variables.”
MethodGlobal Optimization of Statistical Functions with Simulated Annealing
Goffe, W. L., Ferrier, G. D., & Rogers, J. (1994) · Journal of Econometrics · doi:10.1016/0304-4076(94)90038-8 · Cited by 1,610
“In fact, it need not even be differentiable [Corana et al. (1987) successfully demonstrate simulated annealing on a parabolic function punctured with holes].”
BackgroundMethodRecent approaches to global optimization problems through Particle Swarm Optimization
Parsopoulos, K. E., & Vrahatis, M. N. (2002) · Natural Computing · doi:10.1023/a:1016568309421 · Cited by 1,406
A literature survey of benchmark functions for global optimisation problems
Jamil, M., & Yang, X. S. (2013) · International Journal of Mathematical Modelling and Numerical Optimisation · doi:10.1504/ijmmno.2013.055204 · Cited by 1,301
Metadata
- Authors
- Corana, A., Marchesi, M., Martini, C., & Ridella, S.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 1987-09
- Volume
- 13
- Issue
- 3
- Pages
- 262-280
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2088978850
- Cited by
- 1,531
- References
- 14
- FWCI
- 5.24
- Type
- journal article
- Language
- en
- Open access
- bronze
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.