Convergence and first hitting time of simulated annealing algorithms for continuous global optimization

M. Locatelli

Mathematical Methods of Operations Research, 2001, vol. 54, issue 2, 199 pages

Abstract: In this paper simulated annealing algorithms for continuous global optimization are considered.Under the simplifying assumption of known optimal value, the convergence of the algorithms and an upper bound for the expected first hitting time, i.e. the expected number of iterations before reaching the global optimum value within accuracy ε, are established. The obtained results are compared with those for the ideal algorithm PAS (Pure Adaptive Search) and for the simple PRS (Pure Random Search) algorithm. Copyright Springer-Verlag Berlin Heidelberg 2001

Keywords: Key words: global optimization; simulated annealing; convergence; first hitting time (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860100149 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:54:y:2001:i:2:p:171-199

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860100149

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().