Optimization by random search with jumps
We give a random optimization (RO) algorithm to optimize a real‐valued function of n real variables. During the optimization process, interpolation points are examined to follow valleys, and jumps to new starting points are executed to avoid numerous iterations in local minima. Convergence with prob...
Saved in:
Published in | International journal for numerical methods in engineering Vol. 60; no. 7; pp. 1301 - 1315 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Chichester, UK
John Wiley & Sons, Ltd
21.06.2004
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!