Global optimization methods

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. 

We start with continuous variable optimization and consider in the next section the solution of NLP problems with differentiable objective and constraint functions. If only local solutions are required for the NLP problem, then very efficient large-scale methods can be considered. This is followed by methods that are not based on local optimality criteria we consider direct search optimization methods that do not require derivatives as well as deterministic global optimization methods. Following this, we consider the solution of mixed integer problems and outline the main characteristics of algorithms for their solution. Finally, we conclude with a discussion of optimization modeling software and its implementation on engineering models. 

If the matrix Q is positive semidefinite (positive definite) when projected into the null space of the active constraints, then (3-98) is (strictly) convex and the QP is a global (and unique) minimum. Otherwise, local solutions exist for (3-98), and more extensive global optimization methods are needed to obtain the global solution. Like LPs, convex QPs can be solved in a finite number of steps. However, as seen in Fig. 3-57, these optimal solutions can lie on a vertex, on a constraint boundary, or in the interior. A number of active set strategies have been created that solve the KKT conditions of the QP and incorporate efficient updates of active constraints. Popular methods include null space algorithms, range space methods, and Schur complement methods. As with LPs, QP problems can also be solved with interior point methods [see Wright (1996)]. 

Rinnooy Kan, A. H. G. and G. T. Timmer. Stochastic Global Optimization Methods, Part 2 Multi Level Methods. Math Prog 39 57-78 (1987). 

Adjiman, C. S. I. P. Androulakis and C. A. Floudas. A Global Optimization Method aBB, for General Twice-Differentiable Constrained NLPs II. Implementation and Computational Results. Comput Chem Eng 22 1159-1179 (1998). 

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. 

Moles, C. G., Mendez, P., Banga, J. R., Parameter estimation in biochemical pathways a comparison of global optimization methods, Genome Res. 2003,13 2467-2474. 

Such methods solve the kinetic equation for the specific mass, which is then compared with the experimental value to obtain a residual. The kinetic parameters are then adjusted using a global optimization method to minimize the residual. 

Of course, besides stochastic global optimization methods, there are also many deterministic methods [138-140]. Typical applications of these to clusters have so far been possible only for trivially small clusters, for example, LJ7 in Ref. [ 141 ] or LJ 13 in Ref. [ 142]. Clearly, this is no match at all for the stochastic methods that have now reached LJ309 in the CSA work of Lee et al. [133]. 

Athias V., Mazzega P., and Jeandel C. (2000) Selecting a Global optimization method to estimate the oceanic particle cycling rate constants. J. Mar. Res. 58(5), 675-707. 

Extensive reviews on global optimization can be found in Horst (1990) and Horst and Tuy (1990). In this section we present a summary of a global optimization method that has been developed by Quesada and Grossmann for solving nonconvex NLP problems which have the special structure that they involve linear fractional and bilinear terms. It should be noted that global optinuzation has clearly become one of the new trends in optimization and synthesis, and active workers involved in this area include Floudas and Visweswaran (1990), Swaney (1990), Manousiouthakis and Sourlas (1992), and Sahinidis (1993). 

In this chapter PM will be described first, then DM will be analyzed more extensively and, finally, an overview of the most commonly used global optimization methods in direct space is given. 

In recent years an increasing number of crystal structures have been solved by application of pure or hybrid global optimization methods applied to powder diffraction data. The most striking applications regard organic structures particularly resistant to traditional methods. The first organic material of... 

Table 8.1 Recent examples of organic structures solved by global optimization methods applied to powder diffraction data.

For classical parameterization approaches see for instance Bowen and Allinger (1991). For the use of a global optimization method for force field parameterization see Hunger et al. (1998). 

---