Skip to Main content Skip to Navigation
New interface
Conference papers

Simulated annealing: a review and a new scheme

Thomas Guilmeau 1 Emilie Chouzenoux 1 Víctor Elvira 2 
1 OPIS - OPtimisation Imagerie et Santé
Inria Saclay - Ile de France, CVN - Centre de vision numérique
Abstract : Finding the global minimum of a nonconvex optimization problem is a notoriously hard task appearing in numerous applications, from signal processing to machine learning. Simulated annealing (SA) is a family of stochastic optimization methods where an artificial temperature controls the exploration of the search space while preserving convergence to the global minima. SA is efficient, easy to implement, and theoretically sound, but suffers from a slow convergence rate. The purpose of this work is twofold. First, we provide a comprehensive overview on SA and its accelerated variants. Second, we propose a novel SA scheme called curious simulated annealing, combining the assets of two recent acceleration strategies. Theoretical guarantees of this algorithm are provided. Its performance with respect to existing methods is illustrated on practical examples.
Document type :
Conference papers
Complete list of metadata
Contributor : Emilie Chouzenoux Connect in order to contact the contributor
Submitted on : Thursday, July 1, 2021 - 9:35:42 AM
Last modification on : Sunday, June 26, 2022 - 9:25:12 AM
Long-term archiving on: : Saturday, October 2, 2021 - 6:29:28 PM


Files produced by the author(s)


  • HAL Id : hal-03275401, version 1


Thomas Guilmeau, Emilie Chouzenoux, Víctor Elvira. Simulated annealing: a review and a new scheme. SSP 2021 - IEEE Statistical Signal Processing Workshop, Jul 2021, Rio de Janeiro, Brazil. ⟨hal-03275401⟩



Record views


Files downloads