Global Optimisation
From FraudWiki
It is possible to find the global minimum by finding and removing the local minima. Each local minima is removed by deforming the gradient field as described by Chao[1]. The following illustrates this idea in one dimension but the method guarantees to find the global minimum within any bounded region.
So if we consider the energy function:
E = 2w6 − 15w4 + 24w2 which has extrema at w = +2, +1, 0, -1, -2
Starting from w = 3, we follow the direction of the negative gradient until the first minimum is reached at w = 2. Then we deform the gradient field to remove this extremum from the energy field by `dividing it out' and proceed down the gradient of the deformed field until we reach the next extremum, a maximum, at +1. This process may be repeated until all the extrema have been eliminated. This procedure is illustrated below:
| Energy | Gradient | Extrema removed | |
| so | | |
| and so | | min at w = 2 |
| and so | | max at w = 1 |
| and so | | min at w = 0 |
| and so | | max at w = -1 |
| and so | | min at w = -2 |
References
- Chao J. How to Find Global Minima in Finite Times of Search - IJCNN 1991 2:1079-1084
