Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T15:11:28.082Z Has data issue: false hasContentIssue false

Convergence properties of simulated annealing for continuous global optimization

Published online by Cambridge University Press:  14 July 2016

M. Locatelli*
Affiliation:
Universitá degli studi di Milano
*
∗ Postal address: Dipartimento di Scienze dell'Informazione, Via Comelico, 39/41–20135 Milano, Italy.

Abstract

In this paper conditions for the convergence of a class of simulated annealing algorithms for continuous global optimization are given. The previous literature about the subject gives results for the convergence of algorithms in which the next candidate point is generated according to a probability distribution whose support is the whole feasible set. A class of possible cooling schedules has been introduced in order to remove this restriction.

MSC classification

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1996 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable