DAMTP 2007/NA03 A view of algorithms for optimization without derivatives
نویسنده
چکیده
Let the least value of the function F (x), x∈Rn, be required, where n ≥ 2. If the gradient ∇F is available, then one can tell whether search directions are downhill, and first order conditions help to identify the solution. It seems in practice, however, that the vast majority of unconstrained calculations do not employ any derivatives. A view of this situation is given, attention being restricted to methods that are suitable for noisy functions, and that change the variables in ways that are not random. Particular topics include the McKinnon (1998) example of failure of the Nelder and Mead (1965) simplex method, some convergence properties of pattern search algorithms, and my own recent research on using quadratic models of the objective function. We find that least values of functions of more than 100 variables can be calculated. Department of Applied Mathematics and Theoretical Physics, Centre for Mathematical Sciences, Wilberforce Road, Cambridge CB3 0WA, England.
منابع مشابه
DAMTP 2007/NA05 Developments of NEWUOA for unconstrained minimization without derivatives
The NEWUOA software is described briefly, with some numerical results that show good efficiency and accuracy in the unconstrained minimization without derivatives of functions of up to 320 variables. Some preliminary work on an extension of NEWUOA that allows simple bounds on the variables is also described. It suggests a variation of a technique in NEWUOA for maintaining adequate linear indepe...
متن کاملComparison of particle swarm optimization and tabu search algorithms for portfolio selection problem
Using Metaheuristics models and Evolutionary Algorithms for solving portfolio problem has been considered in recent years.In this study, by using particles swarm optimization and tabu search algorithms we optimized two-sided risk measures . A standard exact penalty function transforms the considered portfolio selection problem into an equivalent unconstrained minimization problem. And in final...
متن کاملFuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization
In the last decades, many efforts have been made to solve multimodal optimization problems using Particle Swarm Optimization (PSO). To produce good results, these PSO algorithms need to specify some niching parameters to define the local neighborhood. In this paper, our motivation is to propose the novel neighborhood structures that remove undesirable niching parameters without sacrificing perf...
متن کاملUse of Volsurf approach for pharmacokinetic optimization of β-carboline derivatives as antitumor agents
The β-carboline derivatives are a large group of naturally-occurring and synthetic alkaloids which have awide spectrum of biological and pharmaceutical properties. The newly developed procedure called VolSurfhas been used to explore a significant correlation between the 3D molecular interaction fields (MIF) andphysicochemical and pharmacokinetic properties of a set of 30 β-carboline compounds a...
متن کاملKinetic Mechanism Reduction Using Genetic Algorithms, Case Study on H2/O2 Reaction
For large and complex reacting systems, computational efficiency becomes a critical issue in process simulation, optimization and model-based control. Mechanism simplification is often a necessity to improve computational speed. We present a novel approach to simplification of reaction networks that formulates the model reduction problem as an optimization problem and solves it using geneti...
متن کامل