Directed search techniques

Basically two search procedures for non-linear parameter estimation applications apply. (Nash and Walker-Smith, 1987). The first of these is derived from Newton s gradient method and numerous improvements on this method have been developed. The second method uses direct search techniques, one of which, the Nelder-Mead search algorithm, is derived from a simplex-like approach. Many of these methods are part of important mathematical computer-based program packages (e.g., IMSL, BMDP, MATLAB) or are available through other important mathematical program packages (e.g., IMSL). 

The gradient search methods require derivatives of the objective functions whereas the direct methods are derivative-free. The derivatives may be available analytically or otherwise they are approximated in some way. It is assumed that the objective function has continuous second derivatives, whether or not these are explicitly available. Gradient methods are still efficient if there are some discontinuities in the derivatives. On the other hand, direct search techniques, which use function values, are more efficient for highly discontinuous functions. 

This relationship is used in an application to a simple binary system to balance the trade-offs between inefficiency (fuel costs) and capital investment. The Second Law optimization yields results identical to those obtained from a traditional direct-search technique. 

This paper has provided a framework for further application of Second Law based design methodology to separation systems. It has done so by providing a relationship that gives the available-energy destruction for a binary separation as a function of the process variables for the case in which the entropy production is primarily due to mass transfer effects. The Second Law methodology has been described and applied to a simple binary separation system. The method yields results identical to those obtained from a traditional direct search technique, and accurately indicates the respective trade-offs between fuel costs and capital investment. 

When the optimization is for the feed temperature in the adiabatic case or the operating temperature in the isothermal case then a direct search technique can easily be used to find the optimum scalar variable that maximizes the conversion. 

Using a direct search technique on the performance index and the steepest ascent method, Seinfeld and Kumar (1968) reported computational results on non-linear distributed systems. Computational results were also reported by Paynter et al. (1969). Both the gradient and the accelerated gradient methods were used and reported (Beveridge and Schechter, 1970 Wilde, 1964). All the reported computational results were carried out through discretization. However, the property of hyperbolic systems makes them solvable without discretization. This property was first used by Chang and Bankoff (1969). The method of characteristics (Lapidus, I962a,b) was used to synthesize the optimal control laws of the hyperbolic systems. 

There are several direct search techniques for minimizing a function of one variable. The methods generally start from an initial estimate and sequentially move toward the minimum. Univariate or line search techniques play a major role in solving subproblems in more complex direct search algorithms. 

The steep concentration and temperatui-e profiles in the integral reactor did not allow to determine the reaction rates imm.ediately. Therefore, the objective function contains the measured and the calculated concentrations instead of the reaction rates, also the temperatures because of the nonisothermal reactor behaviour. The kinetic parameters must be obtained by direct search techniques like the derivative free simplex method of Nelder and Mead. 

This equation can be solved numerically in three different ways. The first is by direct integration of equation (8.21) and is described in Section 8.5.2. The second method is to treat the objective function as an unconstrained optimization, which can be solved using any direct search technique such as Powell s method (1964). This approach is computationally faster than the direct integration but requires good initial estimates for the volumes. The third method is to differentiate equation (8.21) to give two nonlinear equations ... 

Search methods consist of the optimization of an appropriate objective function, 0(0), which is usually the likelihood or posterior distribution functions or, for a single-response model with a normal distribution of errors, the sum of squares of the residuals. The latter case is implied in the following discussion. Various gradient and direct search techniques for single-response objective functions are discussed elsewhere (see, e.g., Bard, 1974, Chap. 5 Draper and Smith, 1981, Chap. 10). 

Structure-goal strategies—directed at the structure of a potential intermediate or potential starting material. Such a goal greatly narrows a retrosynthetic search and allows the application of bidirectional search techniques. 

If we have very little information about the parameters, direct search methods, like the LJ optimization technique presented in Chapter 5, present an excellent way to generate very good initial estimates for the Gauss-Newton method. Actually, for algebraic equation models, direct search methods can be used to determine the optimum parameter estimates quite efficiently. However, if estimates of the uncertainty in the parameters are required, use of the Gauss-Newton method is strongly recommended, even if it is only for a couple of iterations. 

Validity describes accuracy and reflects the soundness of the information. The information retrieved is valid if it is accurate, precise, unbiased, and provides a true picture of what is in the literature. The usefulness of the information is directly related to relevance and validity and inversely related to the work needed to access the information. While the work expended is under the direct control of the searcher, it is not unlimited. Therefore, given the limited amount of work time that is available to the information searcher, the most useful information resources will be those that are easy and quick to use and provide relevant, valid information. Skillful searchers can control work time, but relevance and validity are intrinsic characteristics of the resources themselves. A knowledgeable searcher will not only choose resources that are known to be relevant and valid, but will also use search techniques and filters that winnow out the irrelevant and invalid. 

Other more mathematical techniques, which rely on appropriate computer software and are examples of chemometrics (p. 33), include the generation of one-, two- or three-dimensional window diagrams, computer-directed searches and the use of expert systems (p. 529). A discussion of these is beyond the scope of this text. 

Qian, K. Killinger, W.E. Casey, M. Nicol, G.R. Rapid Polymer Identification by In-Source Direct Pyrolysis Mass Spectrometry and Library Searching Techniques. Anal. Chem. 1996, 68, 1019-1027. 

The various match factors calculated by the matching program are listed in Table I. The overall match factor (PT) is a combination of forward and reverse searching techniques. It takes into account the deviations in intensity of the sample spectrum peaks with respect to the candidate spectrum peaks and vice versa for all peaks in both spectra. The pattern correspondence match factor (PC) is a forward searching match factor which takes into account the intensity deviations of sample spectrum peaks with respect to the candidate spectrum peaks for peaks common to both spectra. This factor detects structural similarities, such as substructures, based on common spectral patterns. NC, NS, and NR give an indication of the number of peaks upon which the match was based and in which direction it was most successful. IS and IR indicate the magnitude of the ion current unmatched in each direction. These match factors are similar to those proposed by Damen, Henneberg, and Wiemann (9). 

Hurst, T. Flexible 3D searching the directed tweak technique. /. Chem. Inf. Comput. Sci. 1994, 34, 190-196. 

---