Global optimization simulated annealing

The Simulated Annealing (SA) optimization routine implements the continuous simulated annealing global optimization algorithm (Corana, Marchesi, Martini, Ridella, 1987). 

Note The segmentation operation yields a near-optimal estimate x that may be used as initialization point for an optimization algoritlim that has to find out the global minimum of the criterion /(.). Because of its nonlinear nature, we prefer to minimize it by using a stochastic optimization algorithm (a version of the Simulated Annealing algorithm [3]). 

This criterion resumes all the a priori knowledge that we are able to convey concerning the physical aspect of the flawed region. Unfortunately, neither the weak membrane model (U2 (f)) nor the Beta law Ui (f)) energies are convex functions. Consequently, we need to implement a global optimization technique to reach the solution. Simulated annealing (SA) cannot be used here because it leads to a prohibitive cost for calculations [9]. We have adopted a continuation method like the GNC [2]. 

Je next introduce the basic algorithms and then describe some of the mmy variants upon lem. We then discuss two methods called evolutionary algorithms and simulated anneal-ig, which are generic methods for locating the globally optimal solution. Finally, we discuss jme of the ways in which one might cinalyse the data from a conformational malysis in rder to identify a representative set of conformations. 

Alternative algorithms employ global optimization methods such as simulated annealing that can explore the set of all possible reaction pathways [35]. In the MaxFlux method it is helpful to vary the value of [3 (temperamre) that appears in the differential cost function from an initially low [3 (high temperature), where the effective surface is smooth, to a high [3 (the reaction temperature of interest), where the reaction surface is more rugged. 

II with a new chapter (for the second edition) on global optimization methods, such as tabu search, simulated annealing, and genetic algorithms. Only deterministic optimization problems are treated throughout the book because lack of space precludes discussing stochastic variables, constraints, and coefficients. 

A. Dekkers and E. Aarts, Math Prog., 50, 367 (1991). Global Optimization and Simulated Annealing. 

---