Abstract
Two global optimization algorithms are presented. Both algorithms attempt to minimize an unconstrained objective function through the modeling of dynamic search trajectories. The first, namely the Snyman–Fatti algorithm, originated in the 1980's and still appears an effective global optimization algorithm. The second algorithm is currently under development, and is denoted the modified bouncing ball algorithm. For both algorithms, the search trajectories are modified to increase the likelihood of convergence to a low local minimum. Numerical results illustrate the effectiveness of both algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Schoen, F. (1991), Stochastic Techniques for Global Optimization: A Survey of Recent Advances, J. Global Optim. 1, 207–228.
Törn, A. and Zilinskas, A. (1989), Global Optimization: Lecture Notes in Computer Science, 350, Springer-Verlag, Berlin.
Arora, J.S., El-wakeil, O.A., Chahande, A.I. and Hsieh, C.C. (1995), Global Optimization Methods for Engineering Applications: A Review, Preprint.
Griewank, A.O. (1981), Generalized Descent for Global Optimization, J. Optim. Theory Appl. 34, 11–39.
Snyman, J.A. and Fatti, L.P. (1987), A Multi-start Global Minimization Algorithm with Dynamic Search Trajectories, J. Optim. Theory Appl., 54, 121–141.
Dixon, L.C.W., Gomulka, J. and Szegö, G.P. (1975), Towards a Global Optimization Technique, (in Dixon, L.C.W. and Szegö, G.P., (eds.), Towards Global Optimization, North-Holland, Amsterdam, pp. 29–54.
Snyman, J.A. (1982), A New and Dynamic Method for Unconstrained Minimization, Appl. Math. Modeling 6, 449–462.
Snyman, J.A. (1983), An Improved Version of the Original Leap-Frog Dynamic Method for Unconstrained Minimization: LFOP1(b), Appl. Math. Modeling 7, 216–218.
Dixon, L.C.W., Gomulka, J. and Hersom, S.E. (1976), Reflections on the Global Optimization Problem, in Dixon, L.C.W., (ed.), Optimization in Action, Academic Press, London, pp. 398–435.
Dixon, L.C.W. and Szegö, G.P. (1978), The Global Optimization Problem: An Introduction, in Dixon, L.C.W. and Szegö, G.P., (eds.), Towards Global Optimization 2, North-Holland, Amsterdam, pp. 1–15.
Branin, F.H. (1972), Widely Used Convergent Methods for Finding Multiple Solutions of Simultaneous Equations, IBM J. Research Develop. 504–522.
Lucidi, S. and Piccioni, M. (1989), Random Tunneling by means of Acceptance¶ rejection Sampling for Global Optimization, J. Opt. Theory Appl. 62, 255–277.
Branin, F.H. and Hoo, S.K. (1972), A Method for Finding Multiple Extrema of a Function of n Variables, in Lootsma, F.A. (ed.), Numerical Methods of Nonlinear Optimization, Academic Press, London, pp. 231–237.
Barhen, J., Protopopescu, V. and Reister, D. (16 May 1997), TRUST: A Deterministic Algorithm for Global Optimization, Science 276, 1094–1097.
Zielinsky, R. (1981), A Statistical Estimate of the Structure of Multiextremal Problems, Math.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Groenwold, A.A., Snyman, J. Global Optimization using Dynamic Search Trajectories. Journal of Global Optimization 24, 51–60 (2002). https://doi.org/10.1023/A:1016267007352
Issue Date:
DOI: https://doi.org/10.1023/A:1016267007352