Optimization (2)
–Simulated
Annealing.
•Pick site, i, at
random. Let f’ be old
labels, f be f’ with fi randomly changed.
•p = min(1, P(f/f’)).
•Replace f’ with f with
probability p.
• As T -> 0 method becomes
deterministic.
By slowly
lowering T states of f become
a Markov chain guaranteed to converge to global optimum.
•This takes exponential
time.
