Derivative-free optimization
From Infogalactic: the planetary knowledge core
Derivative free optimization (or derivative-free optimization) is a subject of mathematical optimization. It may refer to problems for which derivative information is unavailable, unreliable or impractical to obtain (derivative-free optimization problems), or methods that do not use derivatives (derivative-free optimization methods).[1]
Contents
Introduction
Lua error in package.lua at line 80: module 'strict' not found.
Examples of derivative-free optimization problems
Lua error in package.lua at line 80: module 'strict' not found.
Derivative-free optimization algorithms
Powell's COBYLA, UOBYQA, NEWUOA, BOBYQA and LINCOA
Shuffled Complex Evolution Algorithm
Software
Lua error in package.lua at line 80: module 'strict' not found.
See also
References
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
|
 |
|||||||||||||||||
|
||||||||||||||||||
|
||||||||||||||||||
|
||||||||||||||||||
|
|
||||||||||||||||||
|
||||||||||||||||||
