A parallel method for verifying global optimization (Q2715929)

The PhD thesis deals with the application of interval arithmetic in combination with parallel processing for solving global optimization problems. Interval arithmetics is used for verifying global optimizer. In this PhD thesis a new concept of parallelization is developed which promise a higher speed up with respect to comparable serial programming as it is given by parallel methods of Dixon/ Jha Zbl 0797.90090, Henriksen/Madsen Zbl 0829.65080, Eriksson (PhD University of Umea, Sweden 1991, see also Zbl 0833.65053 ) and Moore/Hanson/Leclerc (''Rigorous methods for global optimization'' in Floudas, C. A., Pardalos, P. M. (eds.): Recent Advances in Global Optimization, Princeton University Press, 1992, see also Leclerc Zbl 0829.65084). A new multi section strategy for boxes and the use of the best-first strategy for the selection of the box play an important role for the achieved efficiency. The classical acceleration tools are used.