Simulated annealing for single minimum optimization problems
Karl Heinz Hoffmann, Peter B. Salamon · International Journal of Computer Mathematics · 1991
Two examples are presented which show that simulated annealing can perform better than quenching and steepest descent even on problems with a single minimum. An implication for real global optimization problems is that simulated annealing can be useful even on time scales which are short compared to the time required for a greedy algorithm to reach the nearest local minimum.