Derivative free algorithms

Ralston, M. L., and R. Jennrich, DUD, a derivative-free algorithm for nonlinear least squares. Technometrics, 20, 7-14 (1978). 

The Simplex algorithm and that of Powell s are examples of derivative-free methods (Edgar and Himmelblau, 1988 Seber and Wild, 1989, Powell, 1965). In this chapter only two algorithms will be presented (1) the LJ optimization procedure and (2) the simplex method. The well known golden section and Fibonacci methods for minimizing a function along a line will not be presented. Kowalik and Osborne (1968) and Press et al. (1992) among others discuss these methods in detail. 

Derivative-free Optimization (DFO) In the past decade, the availability of parallel computers and faster computing hardware and the need to incorporate complex simulation models within optimization studies have led a number of optimization researchers to reconsider classical direct search approaches. In particular, Dennis and Torczon [SIAM J. Optim. 1 448 (1991)] developed a multidimensional search algorithm that extends the simplex approach of Nelder... 

A is the solvent-accessible surface area of the fth group (computed with the algorithm of Reference 96), a, is an empirically derived free energy parameter for the /th group, and N is the number of groups in the oligopeptide. 

Various rate equations have been considered to fit the experimental data. The kinetic parameters involved in the equations have been estimated by means of a derivative-free minimisation algorithm, in order to compare the different models with respect to the sum of... 

Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for non-linear least square approximation. Numer. Math., 18,... 

Minimisation Algorithms Production data integration must, in some way, involve forward simulation of the fluid flow model. In MLE or MAP, even with reparameterisation, an optimisation method must be used. There are two choices to use a derivative-free method, or to use derivatives. 

Let us first provide an expression to compute the derivative of the free energy for unconstrained simulations. Then, we will discuss the calculation of the biasing force and the algorithmic implementation of the method. 

Here we describe the model selection algorithm that is used to derive microdynamic (model-free) parameters for each NH group from 15N relaxation data. It is implemented in our program DYNAMICS [9]. Given the overall rotational diffusion tensor parameters (isotropic or anisotropic) derived as described above, this analysis is performed independently for each NH-group in order to characterize its local mobility. 

An important group of methods relies on the inherent order of the data, typically time in kinetics or chromatography. These methods are often based on Evolving Factor Analysis and its derivatives. Another well known family of model-free methods is based on the Alternating Least-Squares algorithm that solely relies on restrictions such as positive spectra and concentrations. 

Chemical Laboratory Sample Identifier (LSI) An identifier that uniquely identifies a chemical sample. Although the format of sample identifier differs from organization to organization, it usually consists of five parts a prefix that specifies the sample s source (e.g., synthesized internally or acquired from external sources) a base that uniquely specifics parent structure a form that indicates whether a chemical sample is a free base or with salt, radiolabeled, or a formulation a parity bit checksum that is derived from the combination of prefix, base, and form using a check-sum hash algorithm and a batch or a lot number that identifies the actual physical sample. 

---