GNU Scientific Library – Reference Manual: Multimin Caveats

Next: Initializing the Multidimensional Minimizer, Previous: Multimin Overview, Up: Multidimensional Minimization [Index]

### 36.2 Caveats

Note that the minimization algorithms can only search for one local minimum at a time. When there are several local minima in the search area, the first minimum to be found will be returned; however it is difficult to predict which of the minima this will be. In most cases, no error will be reported if you try to find a local minimum in an area where there is more than one.

It is also important to note that the minimization algorithms find local minima; there is no way to determine whether a minimum is a global minimum of the function in question.