Abstract
We present a new parallel method for verified global optimization, using a centralized mediator for the dynamic load balancing. The new approach combines the advantages of two previous models, the master slave model and the processor farm. Numerical results show the efficiency of this new method. For a large number of problems at least linear speedup is reached. The efficiency of this new method is also confirmed by a comparison with other parallel methods for verified global optimization. A theoretical study proves that using the best-first strategy to choose the next box for subdivision, no real superlinear speedup may be expected concerning the number of iterations. Moreover, the potential of parallelization of methods of verified global optimization is discussed in general.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alefeld, G., Herzberger, J. (1983), Introduction to Interval Computations, Academic Press, New York.
Berner, S. (1995), Ein paralleles Verfahren zur verifizierten globalen Optimierung, PhD Thesis, Bergische Universität GH Wuppertal, Germany.
Berner, S. (1996a), Parallel validated global optimization. To appear in ZAMM.
Berner, S. (1996b), A parallel method for verified global optimization, in Alefeld, G., Frommer, A., Lang, B. (eds.), Scientific Computing and Validated Numerics, Akademie-Verlag, Berlin, 200–206.
Berner, S. (1996c), New results on verified global optimization. Accepted for publication in Computing.
Csendes, T., Ratz, D., Subdivision direction selection in interval methods for global optimization. To appear in SIAM Journal of Numerical Analysis.
Eriksson, J. (1991), Parallel global optimization using interval analysis, Licentiate Thesis, University of Umeå.
Hansen, E. (1992), Global Optimization Using Interval Analysis, Marcel Dekker, New York.
Henriksen, T., Madsen, K. (1992), Use of a depth-first strategy in parallel global optimization, Tech. Report 92–10, Institute for Numerical Analysis, Technical University of Denmark, Lyngby.
Leclerc, A. (1993), Parallel interval global optimization and its implementation in C++, Interval Computations, 3, 148–163.
Klatte, R., Kulisch, U., Neaga, M., Ratz, D., and Ullrich, C. (1991), Pascal-XSC — Sprachbeschreibung mit Beispielen, Springer-Verlag, Berlin, Heidelberg.
Klatte, R., Kulisch, U., Lawo, C., Rauch, M., and Wiethoff, A. (1993), C-XSC — A C++ Class Library for Extended Scientific Computing, Springer-Verlag, Berlin, Heidelberg.
Moore, R. E., Hansen, E., Leclerc, A. (1992), Rigorous methods for global optimization, in Floudas, C. A., Pardalos, P. M. (eds.), Recent Advances in Global Optimization, Princeton University Press.
Neumaier, A. (1990), Interval methods for systems of equations, Cambridge University Press, Cambridge.
Ratschek, H., Rokne, J. (1988), New Computer Methods for Global Optimization, Ellis Horwood, Chichester.
Ratz, D., Csendes, T. (1995), On the selection of subdivision directions in interval branch-and-bound methods for global optimization, Journal of Global Optimization, 7, 183–207.
Rinnoy Kan, A. H. G., Timmer, G. T. (1987), Stochastic global optimization methods, Part II: Multi level methods, Mathematical Programming, 39, 57–78.
Smith, S. L., Schnabel, R. B. (1992), Dynamic scheduling strategies for an adaptive, asynchronous parallel global optimization algorithm, Tech. Report CU-CS-625-92, University of Colorado.
Törn, A., Žilinskas, A. (1989), Global Optimization, Springer-Verlag, Berlin, Heidelberg.
Walster, G., Hansen, E., Sengupta, S. (1985), Test results for a global optimization algorithm, in Boggs, P., Byrd, R., Schnabel, R. (eds.), Numerical Optimization 1984, SIAM, Philadelphia, 272–287.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Berner, S. Parallel methods for verified global optimization practice and theory. J Glob Optim 9, 1–22 (1996). https://doi.org/10.1007/BF00121748
Issue Date:
DOI: https://doi.org/10.1007/BF00121748