How safe / mature is the simulated annealing algorithm given in Numerical Recipes?

The authors of "Numerical recipes" are given in Ch. 10 is an implementation of a simulated annealing algorithm that combines the β€œclassic” simulated annealing using the Nelder-Mead simplex snowmobile method.

What I really like about this algorithm is how it converges to the classic descent search when the annealing temperature reaches 0. However, I never found any other reference to this algorithm; Is it a safe, mature version of a simulated annealing algorithm (i.e., ready for production) or should it be considered as an experimental idea thrown into a book?

+6
source share
1 answer

No, it’s not safe, guaranteed to give you herpes.

As a person who professionally works with AI and intelligent systems, I can say that very few such algorithms are considered mature. By their nature, advanced algorithms tend to have an experimental aspect to them. For example, with simulated annealing, you need to create a cooling schedule. How you do this is very problematic and will require you to experiment and tune the algorithm. The NR code is a reasonable starting point for this.

+3
source

All Articles