zbMATH — the first resource for mathematics

A multi-start global minimization algorithm with dynamic search trajectories. (English) Zbl 0595.90073
A new multi-start algorithm for global unconstrained minimization is presented in which the search trajectories are derived from the equation of motion of a particle in a conservative force field, where the function to be minimized represents the potential energy. The trajectories are modified to increase the probability of convergence to a comparatively low local minimum, thus increasing the region of convergence of the global minimum. A Bayesian argument is adopted by which, under mild assumptions, the confidence level that the global minimum has been attained may be computed. When applied to standard and other test functions, the algorithm never failed to yield the global minimum.

90C30 Nonlinear programming
49M37 Numerical methods based on nonlinear programming
65K05 Numerical mathematical programming methods
Full Text: DOI
[1] Griewank, A. O.,Generalized Descent for Global Optimization, Journal of Optimization Theory and Applications, Vol. 34, pp. 11-39, 1981. · Zbl 0431.49036 · doi:10.1007/BF00933356
[2] Dixon, L. C. W., Gomulka, J., andSzegö, G. P.,Toward a Global Optimization Technique, Toward Global Optimization, Edited by L. C. W. Dixon and G. P. Szegö, North-Holland Publishing Company, Amsterdam, Holland, pp. 29-54, 1975.
[3] Dixon, L. C. W., Gomulka, J., andHersom, S. E.,Reflections on the Global Optimization Problem, Optimization in Action, Edited by L. C. W. Dixon, Academic Press, New York, New York, pp. 398-435, 1976.
[4] Snyman, J. A.,A New and Dynamic Method for Unconstrained Minimization, Applied Mathematical Modelling, Vol. 6, pp. 449-462, 1982. · Zbl 0501.65026 · doi:10.1016/S0307-904X(82)80007-3
[5] Snyman, J. A.,An Improved Version of the Original Leap-Frog Dynamic Method for Unconstrained Minimization: LFOP1(b), Applied Mathematical Modelling, Vol. 7, pp. 216-218, 1983. · Zbl 0548.65046 · doi:10.1016/0307-904X(83)90011-2
[6] Levitt, M.,Molecular Dynamics of Native Protein, I: Computer Simulation of Trajectories, Journal of Molecular Biology, Vol. 168, pp. 595-620, 1983. · doi:10.1016/S0022-2836(83)80304-0
[7] Snyman, J. A. andSnyman, H. C.,Computed Epitaxial Monolayer Structures, III, Surface Science, Vol. 105, pp. 357-376, 1981. · doi:10.1016/0039-6028(81)90168-0
[8] Inomata, S., andCumada, M.,On the Golf Method, Denshi Gijutso Sogo Kenkyujo, Tokyo, Japan, Bulletin of the Electrotechnical Laboratory, Vol. 25, pp. 495-512, 1964.
[9] Incerti, S., Parisi, V., andZirilli, F.,A New Method for Solving Nonlinear Simultaneous Equations, SIAM Journal on Numerical Analysis, Vol. 16, pp. 779-789, 1979. · Zbl 0411.65028 · doi:10.1137/0716057
[10] Arnold, V. I., andAvez, A.,Ergodic Problems of Classical Mechanics, W. A. Benjamin, New York, New York, 1968.
[11] Rinnooy Kan, A. H. G., andTimmer, G. T.,Stochastic Methods for Global Optimization, American Journal of Mathematical and Management Sciences, Vol. 4, pp. 7-40, 1984. · Zbl 0556.90073
[12] Box, G. E. P., andTiao, G. C.,Bayesian Inference in Statistical Analysis, Addison-Wesley, London, England, 1973. · Zbl 0271.62044
[13] Dixon, L. C. W., andSzegö, G. P.,The Global Optimization Problem: An Introduction, Toward Global Optimization 2, Edited by L. C. W. Dixon and G. P. Szegö, North-Holland Publishing Company, Amsterdam, Holland, pp. 1-15, 1978.
[14] Price, W. L.,Global Optimization by Controlled Random Search, Journal of Optimization Theory and Applications, Vol. 40, pp. 333-348, 1983. · Zbl 0494.90063 · doi:10.1007/BF00933504
[15] Anonymous, N. N.,International Mathematical and Statistical Libraries, Vol. 4, Edition 9, IMSL, Houston, Texas, 1982.
[16] Boender, C. G. E., Rinnooy Kan, A. H. G., Timmer, G. T., andStougie, L.,A Stochastic Method for Global Optimization, Mathematical Programming, Vol. 22, pp. 125-140, 1982. · Zbl 0525.90076 · doi:10.1007/BF01581033
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.