Comparison of Dimensionality Reduction Schemes for Parallel Global Optimization Algorithms

Barkalov, Konstantin; Sovrasov, Vladislav; Lebedev, Ilya

doi:10.1007/978-3-030-05807-4_5

Cited by 2 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where the constant H is defined by the relation 2), and N is the dimensionality of the optimization problem (1). The algorithms for the numerical construction of the Peano curve approximations are given in [51].…”

Section: φ(Y(xmentioning

confidence: 99%

“…Core Multidimensional Algorithm of Global Search. The informationstatistical theory of global optimization formulated in [48], [51] has served as a basis for the development of a large number of efficient multiextremal optimization methods [1], [18], [19], [23], [30], [42], [43], [45], [46], [47].…”

Section: • the Parallelization Of The Optimization Algorithms (Task Parallelization Scheme)mentioning

confidence: 99%

See 1 more Smart Citation

Globalizer: A novel supercomputer software system for solving time-consuming global optimization problems

Gergel¹,

Barkalov²,

Sysoyev³

2018

Numerical Algebra, Control &Amp; Optimization

Self Cite

View full text Add to dashboard Cite

In this paper, we describe the Globalizer software system for solving the global optimization problems. The system is designed to maximize the use of computational potential of the modern high-performance computational systems in order to solve the most time-consuming optimization problems. The highly parallel computations are facilitated using various distinctive computational schemes: processing several optimization iterations simultaneously, reducing multidimensional optimization problems using multiple Peano spacefilling curves, and multi-stage computing based on the nested block reduction schemes. These novelties provide for the use of the supercomputer system capabilities with shared and distributed memory and with large numbers of processors to solve the global optimization problems efficiently.

show abstract

Section: φ(Y(xmentioning

confidence: 99%