Extended Pincus theorems and convergence of simulated annealing
- 1 August 1989
- journal article
- research article
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 20 (8) , 1521-1533
- https://doi.org/10.1080/00207728908910235
Abstract
Pincus’ 1968 formula for the (unique) global minimum of a continuous function on a compact set in E n is extended to finite multiple optima and to discrete and special variants. The impact of these on associated ergodic irreducible aperiodic Markov chain computation (Pincus 1970)—currently called ‘simulated annealing’—is exemplified and assessed leading to grave concern about what current simulated annealing processes may converge to, instead of optima.Keywords
This publication has 9 references indexed in Scilit:
- Simulated annealing algorithms: an overviewIEEE Circuits and Devices Magazine, 1989
- On Eigenvalues and Annealing RatesMathematics of Operations Research, 1988
- Cooling Schedules for Optimal AnnealingMathematics of Operations Research, 1988
- Simulated Annealing: Theory and ApplicationsPublished by Springer Nature ,1987
- Optimization by Simulated AnnealingScience, 1983
- Letter to the Editor—-A Closed Form Solution of Certain Programming ProblemsOperations Research, 1968
- Monte Carlo MethodsPublished by Springer Nature ,1964
- The Monte Carlo MethodJournal of the American Statistical Association, 1949
- Approximations to a Class of Double Integrals of Functions of Large NumbersAmerican Journal of Mathematics, 1948