×

Parallel branch and bound algorithm with combination of Lipschitz bounds over multidimensional simplices for multicore computers. (English) Zbl 1188.68353

Čiegis, Raimondas (ed.) et al., Parallel scientific computing and optimization. Advances and applications. New York, NY: Springer (ISBN 978-0-387-09706-0/hbk). Springer Optimization and Its Applications 27, 93-102 (2009).
Summary: Parallel branch and bound for global Lipschitz minimization is considered. A combination of extreme (infinite and first) and Euclidean norms over a multidimensional simplex is used to evaluate the lower bound. OpenMP has been used to implement the parallel version of the algorithm for multicore computers. The efficiency of the developed parallel algorithm is investigated solving multidimensional test functions for global optimization.
For the entire collection see [Zbl 1151.65001].

MSC:

68W10 Parallel algorithms in computer science
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Hansen, P., Jaumard, B.: Lipshitz optimization. In: R. Horst, P.M. Pardalos (eds.) Handbook of Global Optimization, Nonconvex Optimization and Its Applications, vol. 2, pp. 404-493. Kluwer Academic Publishers (1995) · Zbl 0833.90105
[2] Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization, Nonconvex Optimization and Its Applications, vol. 3. Kluwer Academic Publishers (1995) · Zbl 0836.90134
[3] Jansson, C., Knüppel, O.: A global minimization method: The multi-dimensional case. Tech. rep., TU Hamburg-Harburg (1992)
[4] Madsen, K., Žilinskas, J.: Testing branch-and-bound methods for global optimization. Tech. Rep. IMM-REP-2000-05, Technical University of Denmark (2000) · Zbl 1211.90295
[5] Paulavičius, R.; Žilinskas, J., Analysis of different norms and corresponding Lipschitz constants for global optimization, Technological and Economic Development of Economy, 12, 4, 301-306 (2006)
[6] Paulavičius, R.; Žilinskas, J., Analysis of different norms and corresponding Lipschitz constants for global optimization in multidimensional case, Information Technology and Control, 36, 4, 383-387 (2007)
[7] Žilinskas, J., Optimization of Lipschitzian functions by simplex-based branch and bound, Information Technology and Control, 14, 1, 45-50 (2000)
[8] Žilinskas, J., Branch and bound with simplicial partitions for global optimization, Mathematical Modelling and Analysis, 13, 1, 145-159 (2008) · Zbl 1146.49029 · doi:10.3846/1392-6292.2008.13.145-159
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.