Derivative-free optimization is a discipline in mathematical optimization that does not use derivative information in the classical sense to find optimal solutions: Sometimes information about the derivative of the objective function f is unavailable, unreliable or impractical to obtain. For example, f might be non-smooth, or time-consuming to evaluate, or in some way noisy, so that methods that rely on derivatives or approximate them via finite differences are of little use. The problem to find optimal points in such situations is referred to as derivative-free optimization, algorithms that do not use derivatives or finite differences are called derivative-free algorithms (note that this classification is not precise). Derivative-free optimization is closely related to black-box optimization.
The problem to be solved is to numerically optimize an objective function for some set (usually ), i.e. find such that without loss of generality for all .
When applicable, a common approach is to iteratively improve a parameter guess by local hill-climbing in the objective function landscape. Derivative-based algorithms use derivative information of to find a good search direction, since for example the gradient gives the direction of steepest descent. Derivative-based optimization is efficient at finding local optima for continuous-domain smooth single-modal problems. However, they can have problems when e.g. is disconnected, or (mixed-)integer, or when is expensive to evaluate, or is non-smooth, or noisy, so that (numeric approximations of) derivatives do not provide useful information. A slightly different problem is when is multi-modal, in which case local derivative-based methods only give local optima, but might miss the global one.
In derivative-free optimization, various methods are employed to address these challenges using only function values of , but no derivatives. Some of these methods can be proved to discover optima, but some are rather metaheuristic since the problems are in general more difficult to solve compared to convex optimization. For these, the ambition is rather to efficiently find "good" parameter values which can be near-optimal given enough resources, but optimality guarantees can typically not be given. One should keep in mind that the challenges are diverse, so that one can usually not use one algorithm for all kinds of problems.
It follows a non-exhaustive collection of derivative-free optimization algorithms:
- Bayesian optimization
- Coordinate descent and adaptive coordinate descent
- Cuckoo search
- Evolution strategies, Natural evolution strategies (CMA-ES, xNES, SNES)
- Genetic algorithms
- LIPO algorithm
- MCS algorithm
- Nelder-Mead method
- Particle swarm optimization
- Pattern search
- Powell's COBYLA, UOBYQA, NEWUOA, BOBYQA and LINCOA algorithms
- Random search
- Shuffled complex evolution algorithm
- Simulated annealing
Of the algorithms referred to above, there exist various established implementations either stand-alone or in toolboxes. It follows a non-exhaustive list of software:
- BiteOpt derivative-free stochastic optimization method at GitHub
- Matlab Global Optimization Toolbox: Includes several implementations of derivative-free algorithms
- MEIGO: Several meta-heuristic methods for continuous and (mixed-)integer problems
- PESTO: A parameter optimization toolbox including also various derivative-free methods
- PSWARM: A particle swarm implementation
A comprehensive evaluation of various implementations can be found at.
- Conn, A. R.; Scheinberg, K.; Vicente, L. N. (2009). Introduction to Derivative-Free Optimization. MPS-SIAM Book Series on Optimization. Philadelphia: SIAM. Retrieved 2014-01-18.
- Audet, Charles; Kokkolaras, Michael (2016). "Blackbox and derivative-free optimization: theory, algorithms and applications".
- Rios, LM; Sahinidis, NV (2013). "Derivative-free optimization: a review of algorithms and comparison of software implementations". Journal of Global Optimization. Retrieved 2018-08-16.