Abstract
In this paper we propose a new parallel algorithm for solving global optimization (GO) multidimensional problems. The method unifies two powerful approaches for accelerating the search: parallel computations and local tuning on the behavior of the objective function. We establish convergence conditions for the algorithm and theoretically show that the usage of local information during the global search permits to accelerate solving the problem significantly. Results of numerical experiments executed with 100 test functions are also reported.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bertocchi, M. (1990), A parallel algorithm for global optimization, Optimization 62(3): 379–386.
Butz, A.R. (1968), Space filling curves and mathematical programming, Inform. Control. 12(4): 314–330.
Gergel, V.P. and Sergeyev, Ya.D. (1999) Sequential and parallel global optimization algorithms using derivatives, Computers and Mathematics with Applications, 37(4/5): 163–180.
Grishagin, V.A. (1978), Operation characteristics of some global optimization algorithms, Problems of Stochastic Search 7: 198–206.
Grishagin, V.A., Sergeyev, Ya.D. and Strongin, R.G. (1997), Parallel characteristical global optimization algorithms, J. of Global Optimization 10: 185–206.
Floudas, C.A. and Pardalos, P.M. (1996), Eds., State of the Art in Global Optimization, Kluwer Academic Publishers, Dordrecht/Boston/London.
Horst, R. and Pardalos, P.M. (1995), Eds., Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht/Boston/London.
Migdalas, A., Pardalos, P.M., and Storøy, S. (1997), Eds., Parallel Computing in Optimization, Kluwer Academic Publishers, Dordrecht/Boston/London.
Pardalos, P.M., Phillips, A.T., and Rosen, J.B. (1992), Topics in Parallel Computing in Mathematical Programming, Science Press.
Schendel, U. (1984), Introduction to Numerical Methods for Parallel Computers, Ellis Horwood, Chichester, UK.
Sergeyev Ya.D. (1995) A one-dimensional deterministic global minimization algorithm, Comput. Maths. Math. Phys. 35(5): 705–717.
Sergeyev, Ya.D. (1995), An information global optimization algorithm with local tuning, SIAM J. Optimization 5(4): 858–870.
Sergeyev, Ya.D. (1998), Global one-dimensional optimization using smooth auxiliary functions, Mathematical Programming 81(1): 127–146.
Sergeyev, Ya.D., and Grishagin, V.A. (1994), A parallel method for finding the global minimum of univariate functions, JOTA 80: 513–536.
Sergeyev, Ya.D., and Grishagin, V.A. (1994), Sequential and parallel algorithms for global optimization, Optimization Methods and Software 3: 111–124.
Strongin, R.G. (1978), Numerical Methods on Multiextremal Problems, Nauka, Moscow.
Strongin, R.G. (1992), Algorithms for multiextremal mathematical programming problems employing the set of joint space-filling curves, J. of Global Optimization 2: 357–378.
Strongin, R.G. and Sergeyev, Ya.D. (1992), Global multidimensional optimization on parallel computer, Parallel Computing 18: 1259–1273.
Sutti, C. (1984), Local and global optimization by parallel algorithms for MIMD systems, Annals of Operations Research 1: 151–164.
Van Laarhoven, P.J.M. (1985), Parallel variable metric algorithm for unconstrained optimization, Mathematical Programming 33: 68–87.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sergeyev, Y.D. Parallel Information Algorithm with Local Tuning for Solving Multidimensional GO Problems. Journal of Global Optimization 15, 157–167 (1999). https://doi.org/10.1023/A:1008372702319
Issue Date:
DOI: https://doi.org/10.1023/A:1008372702319