POSTER ID T18

Simulated Annealing: Rigorous finite-time guarantees for optimization on continuous domains
Andrea Lecchini-Visintini University of Leicester
1

John Lygeros ETH Zurich
0.9 0.8

Jan Maciejowski University of Cambridge

0.8

0.7 h()  [U()+0.5]3 0.6 0.5 0.4 0.3 0.2 0.1

0.6 U() 0.4 0.2 0 3 2 1 0 -1 -2  -3 -3
2

0 3

3 2 1 0 -1 -2 
1

2 1 0 -1 -2 2 -3 -3 -2 1 0 -1 1 2

3

2 .5

9 8

2

7 h ()  [U()+0.5]20 6 5 4 3 2 1

h ()  [U()+0.5]6

1 .5

1



0 .5

0 3 2 1 0 -1 -2 2 -3 -3 -2 
1



0 3
3 2 1 0 -1

2 1 0 -1 -2 2 -3 -3 -2 
1

3 2 1 0 -1

Prob{k is approximate (, ) global optimizer} =  - Pk - 

(J )

TV