Stochastic simulation simulated annealing

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]). 

Other methods which are applied to conformational analysis and to generating multiple conformations and which can be regarded as random or stochastic techniques, since they explore the conformational space in a non-deterministic fashion, arc genetic algorithms (GA) [137, 1381 simulation methods, such as molecular dynamics (MD) and Monte Carlo (MC) simulations 1139], as well as simulated annealing [140], All of those approaches and their application to generate ensembles of conformations arc discussed in Chapter II, Section 7.2 in the Handbook. 

Two of the most popular stochastic methods are simulated annealing and genetic algorithms. 

It is also worth noting that the stochastic optimization methods described previously are readily adapted to the inclusion of constraints. For example, in simulated annealing, if a move suggested at random takes the solution outside of the feasible region, then the algorithm can be constrained to prevent this by simply setting the probability of that move to 0. 

Stochastic optimization methods described previously, such as simulated annealing, can also be used to solve the general nonlinear programming problem. These have the advantage that the search is sometimes allowed to move uphill in a minimization problem, rather than always searching for a downhill move. Or, in a maximization problem, the search is sometimes allowed to move downhill, rather than always searching for an uphill move. In this way, the technique is less vulnerable to the problems associated with local optima. 

Various search strategies can be used to locate the optimum. Indirect search strategies do not use information on gradients, whereas direct search strategies require this information. These methods always seek to improve the objective function in each step in a search. On the other hand, stochastic search methods, such as simulated annealing and genetic algorithms, allow some deterioration... 

This criterion requires a search through a nonconvex multidimensional conformation space that contains an immense number of minima. Optimization techniques that have been applied to the problem include Monte Carlo methods, simulated annealing, genetic methods, and stochastic search, among others. For reviews of the application of various optimization methods refer to Pardalos et al. (1996), Vasquez et al. (1994), or Schlick et al. (1999). 

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. 

The second problem can be overcome by using a stochastic search. Thus Corana s simulating annealing SA [89], a sophisticated global search method arising from the Metropolis algorithm [90] was employed. A synthetic seven species problem was constructed and the elements in T-jx were correctly determined using SA. The recovered spectra are essentially identical to the synthetic 7 pure component spectra. [91]... 

Aarts, E. H. L. (1989) Simulated annealing and Boltzmann machines a stochastic approach to combinatorial optimization and neural computing. Wiley, New York. 

The methods of simulated annealing (26), genetic algorithms (27), and taboo search (29) are three of the most popular stochastic optimization techniques, inspired by ideas from statistical mechanics, theory of evolutionary biology, and operations research, respectively. They are applicable to our current problem and have been used by researchers for computational library design. Because SA is employed in this chapter, a more-detailed description of the (generalized) SA is given below. 

Fig. 31. Decrease of energy during simulated annealing. The temperature is exponentially lowered from kT=l to 0. The insert shows a cross section through the energy landscape as a function of the number of stochastic 1-spin-flips...

An alternative to stochastic reconstruction of multiphase media is the reconstruction based on the direct simulation of processes by which the medium is physically formed, e.g., phase separation or agglomeration and sintering of particles to form a porous matrix. An advantage of this approach is that apart from generating a medium for the purpose of further computational experiments, the reconstruction procedure also yields information about the sequence of transformation steps and the processing conditions required in order to form the medium physically. It is thereby ensured that only physically realizable structures are generated, which is not necessarily the case when a stochastic reconstruction method such as simulated annealing is employed. 

---