On the convergence of the Baba and Dorea random optimization methods (Q1825142): Difference between revisions

The global minimization methods of \textit{N. Baba} [ibid. 33, 451-461 (1981; Zbl 0453.90069)] and \textit{C. C. Y. Dorea} [ibid. 39, 165-171 (1983; Zbl 0479.93078)] have been applied to two physical problems. The first one is that of finding the global minimum of the transformer design function of six variables subject to constraints. The second one is the problem of fitting the orbit of a satellite using a set of observations. The latter problem is reduced to that of finding the global minimum of the sum of the squares of the differences between the observed values of the azimuth, elevation, and range at certain intervals of time from the epoch and the computed values of the azimuth, elevation, and range at the same intervals of time. Baba and Dorea established theoretically that the random optimization methods converge to the global minimum with probability one. The numerical experiments carried out for the above two problems show that convergence is very slow for the first problem and is even slower for the second problem. In the both cases, it has not been possible to reach the global minimum, if the search domains of the variables are wide, even after a very large number of function evaluations.