Optimization global minimum

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

Moreover Figure 3 shows the graph of the potential energy of the molecule where E2 and E4 representing structure optimization finished in a local minimum and E6 a global minimum found (internal strain of the molecule minimized). 

Fig. 1.1 (a) In traditional quantum chemical methods the potential energy surface (PES) is characterized in a pointwise fashion. Starting from an initial geometry, optimization routines are applied to localize the nearest stationary point (minimum or transition state). Which point of the PES results from this procedure mainly depends on the choice of the initial configuration. The system can get trapped easily in local minima without ever arriving at the global minimum struc-... 

In problems in which there are n variables and m equality constraints, we could attempt to eliminate m variables by direct substitution. If all equality constraints can be removed, and there are no inequality constraints, the objective function can then be differentiated with respect to each of the remaining (n — m) variables and the derivatives set equal to zero. Alternatively, a computer code for unconstrained optimization can be employed to obtain x. If the objective function is convex (as in the preceding example) and the constraints form a convex region, then any stationary point is a global minimum. Unfortunately, very few problems in practice assume this simple form or even permit the elimination of all equality constraints. 

The KTC comprise both the necessary and sufficient conditions for optimality for smooth convex problems. In the problem (8.25)-(8.26), if the objective fix) and inequality constraint functions gj are convex, and the equality constraint functions hj are linear, then the feasible region of the problem is convex, and any local minimum is a global minimum. Further, if x is a feasible solution, if all the problem functions have continuous first derivatives at x, and if the gradients of the active constraints at x are independent, then x is optimal if and only if the KTC are satisfied at x. ... 

The computational requirement of the aBB algorithm depends on the number of variables on which branching occurs. The most important variables are those variables that substantially influence the nonconvexity of the surface and the location of the global minimum. In the protein-folding problem, the backbone dihedral angles ( and ip) are the most influential variables. Therefore, in very large problems, to further reduce the dimensions of the problem, only these variables were involved in the optimization. 

Figure E 14.4b shows the results of the application of the optimization strategy to solvated Af-acetyl-Af -methyl-alanineamide. Level sets of the deviations of the total energy from the global minimum are shown as solid and dashed lines at 1, 2, 5, and...

---