Abstract
This paper addresses computationally intensive global optimization problems, for solving of which the supercomputing systems with exaflops performance can be required. To overcome such computational complexity, the paper proposes the generalized parallel computational schemes, which may involve numerous efficient parallel algorithms of global optimization. The proposed schemes include various ways of multilevel decomposition of parallel computations to guarantee the computational efficiency of supercomputing systems with shared and distributed memory multiprocessors with thousands of processors to meet global optimization challenges.
Similar content being viewed by others
References
C. A. Floudas and M. P. Pardalos, Recent Advances in Global Optimization (Princeton Univ. Press, Princeton, 2016).
M. Locatelli and F. Schoen, Global Optimization: Theory, Algorithms and Applications (SIAM, Philadelphia, 2013).
R. G. Strongin and Y. D. Sergeyev, Global Optimization with Non-Convex Constraints. Sequential and Parallel Algorithms (Kluwer Academic, Dordrecht, 2000; 2nd ed. 2013; 3rd ed. 2014).
P. M. Pardalos, A. A. Zhigljavsky, and J. Žilinskas, Advances in Stochastic and Deterministic Global Optimization (Springer, New York, 2016).
Y. D. Sergeyev and D. E. Kvasov, Deterministic Global Optimization. An Introduction to the Diagonal Approach, Springer Briefs in Optimization (Springer, New York, 2017).
R. Paulavičius and J. Žilinskas, Simplicial Global Optimization, Springer Briefs in Optimization (Springer, New York, 2014).
R. Čiegis, D. Henty, B. Kågström, and J. Žilinskas, Parallel Scientific Computing and Optimization: Advances and Applications (Springer, Berlin, Heidelberg, 2009).
G. Luque and E. Alba, Parallel Genetic Algorithms. Theory and Real World Applications (Springer, Berlin, 2011).
R. G. Strongin, V. P. Gergel, V. A. Grishagin, and K. A. Barkalov, Parallel Computations for Global Optimization Problems (Mosk. Gos. Univ., Moscow, 2013) [in Russian].
Ya. D. Sergeyev, R. G. Strongin, and D. Lera, Introduction to Global Optimization Exploiting Space-Filling Curves, Springer Briefs in Optimization (Springer, New York, 2013).
R. G. Strongin, Numerical Methods in Multiextremal Problems (Information-Statistical Algorithms) (Nauka, Moscow, 1978) [in Russian].
R. G. Strongin and Y. D. Sergeyev, “Global multidimensional optimization on parallel computer,” Parallel Comput. 18, 1259–1273 (1992).
Y. D. Sergeyev and V. A. Grishagin, “Parallel asynchronous global search and the nested optimization scheme,” J. Comput. Anal. Appl. 3, 123–145 (2001).
V. P. Gergel and S. V. Sidorov, “A two-level parallel global search algorithm for solution of computationally intensive multiextremal optimization problems,” Lect. Notes Comput. Sci. 9251, 505–515 (2015).
V. Gergel, “An unified approach to use of coprocessors of various types for solving global optimization problems,” in Proceedigns of the 2nd International Conference on Mathematics and Computers in Sciences and in Industry, 2015, pp. 13–18.
K. Barkalov, V. Gergel, and I. Lebedev, “Solving global optimization problems on GPU cluster,” in Proceedings of the ICNAAM 2015, Ed. by T. E. Simos, AIPConf.Proc. 1738, 400006 (2016).
V. Gergel and E. Kozinov, “Efficientmethods of multicriterial optimization based on the intensive use of search information,” Springer Proc.Math. Stat. 197, 27–45 (2017).
V. Gergel and E. Kozinov, “Parallel computing for time-consuming multicriterial optimization problems,” Lect. NotesComput. Sci. 10421, 446–458 (2017).
V. Gergel, V. Grishagin, and A. Gergel, “Adaptive nested optimization scheme for multidimensional global search,” J. Global Optimiz. 66, 35–51 (2016).
D. Lera and Y. D. Sergeyev, “Lipschitz and Holder global optimization using space-filling curves,” Appl. Numer.Math. 60, 115–129 (2010).
V. A. Grishagin, “On convergence conditions for a class of global search algorithms,” in Proceedings of the 3rd All-Union Seminar on Numerical Methods of Nonlinear Programming, Kharkov, 1979, pp. 82–84.
V. A. Grishagin, Y. D. Sergeyev, and R. G. Strongin, “Parallel characteristic algorithms for solving problems of global optimization,” J. Global Optimiz. 10, 185–206 (1997).
R. G. Strongin, “Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves,” J. Global Optimiz. 2, 357–378 (1992).
A. Sysoyev, K. Barkalov, V. Sovrasov, I. Lebedev, and V. Gergel, “Globalizer—a parallel software system for solving global optimization problems,” Lect. Notes Comput. Sci. 10421, 492–499 (2017).
Y. D. Sergeyev and V. A. Grishagin, “Parallel asynchronous global search and the nested optimization scheme,” J. Comput. Anal. Appl. 3, 123–145 (2001).
M. Gaviano, D. Lera, D. E. Kvasov, and Ya. D. Sergeyev, “Software for generation of classes of test functions with known local and global minima for global optimization,” ACM Trans. Math. Software 29, 469–480 (2003).
V. Y. Modorskii, D. F. Gaynutdinova, V. P. Gergel, and K. A. Barkalov, “Optimization in design of scientific products for purposes of cavitation problems,” AIP Conf. Proc. 1738, 400013 (2016).
V. P. Gergel, M. I. Kuzmin, N. A. Solovyov, and V. A. Grishagin, “Recognition of surface defects of coldrolling sheets based on method of localities,” Int. Rev. Autom. Control 8, 51–55 (2015).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Strongin, R.G., Gergel, V.P., Barkalov, K.A. et al. Generalized Parallel Computational Schemes for Time-Consuming Global Optimization. Lobachevskii J Math 39, 576–586 (2018). https://doi.org/10.1134/S1995080218040133
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080218040133