Optimization techniques general functions

The sum of squares as defined by Equation 7.8 is the general form for the objective function in nonlinear regression. Measurements are made. Models are postulated. Optimization techniques are used to adjust the model parameters so that the sum-of-squares is minimized. There is no requirement that the model represent a simple reactor such as a CSTR or isothermal PER. If necessary, the model could represent a nonisothermal PFR with variable physical properties. It could be one of the distributed parameter models in Chapters 8 or 9. The model... 

For well-posed quadratic objective functions the contours always form a convex region for more general nonlinear functions, they do not (see tlje next section for an example). It is helpful to construct contour plots to assist in analyzing the performance of multivariable optimization techniques when applied to problems of two or three dimensions. Most computer libraries have contour plotting routines to generate the desired figures. 

There are actually very few. Modern optimization techniques practically guarantee location of a minimum energy structure, and only where the initial geometry provided is too symmetric will this not be the outcome. With a few notable exceptions (Hartree-Fock models applied to molecules with transition metals), Hartree-Fock, density functional and MP2 models provide a remarkably good account of equilibrium structure. Semi-empirical quantum chemical models and molecular mechanics models, generally fare well where they have been explicitly parameterized. Only outside the bounds of their parameterization is extra caution warranted. Be on the alert for surprises. While the majority of molecules assume the structures expected of them, some will not. Treat "unexpected" results with skepticism, but be willing to alter preconceived beliefs. 

Generally, two or more objective functions are defined for gene expression profiling and gene network analysis. Usually, these objectives are conflicting in nature. Use of traditional single objective optimization techniques to solve these multi-objective optimization problems suffer from many drawbacks. Single objective problems either use penalty function approach or use some of the objectives as constraints. Both of these approaches have user-defined biases. Thus, multi-objective optimization techniques are definitely needed to model and solve these and similar other problems. 

Continuous optimization problems are usually easier to solve because the smoothness of the functions makes it possible to use objective and constraint information at a particular point x to deduce information about the function s behavior at all points close to x. In discrete problems, by contrast, the behavior of the objective and constraints may change significantly as we move from one feasible point to another, even if the two points are close by some measure. The feasible sets for discrete optimization problems can be thought of as exhibiting an extreme form of non-convexity, as a convex combination of two feasible points is in general not feasible. Continuous optimization techniques often play an important role in solving discrete optimization problems. For instance, the branch-and-bound... 

In fact, the success of any optimization technique critically depends on the degree to which the model represents and accurately predicts the investigated system. For this reason, the model must capture the complex dynamics in the system and predict with acceptable accuracy the proper elements of reality. Moreover, it is important to be able to recognize the characteristics of a problem and identify appropriate solution techniques within each class of problems there are different optimization methods which vary in computational requirements and convergence properties. These problems are generally classified according to the mathematical characteristics of the objective function, the constraints, and the controllable decision variables. 

In multivariable optimization problems, there is no guarantee that a given optimization technique will find the optimum point in a reasonable amount of computer time. The optimization of a general nonlinear multi-variable objective function, f x) = / x, X2,..., x ), requires that efficient and robust numerical techniques be employed. Efficiency is important, because the solution requires an iterative approach. Trial-and-error solutions are usually out of the question for problems with more than two or three variables. For... 

Most practical multivariable problems include constraints, which must be treated using enhancements of unconstrained optimization algorithms. The next two sections describe two classes of constrained optimization techniques that are used extensively in the process industries. When constraints are an important part of an optimization problem, constrained techniques must be employed, because an unconstrained method might produce an optimum that violates the constraints, leading to unrealistic values of the process variables. The general form of an optimization problem includes a nonlinear objective function (profit) and nonlinear constraints and is called a nonlinear programming problem. 

---