Parallel Scalable Algorithms with Mixed Local-Global Strategy for Global Optimization Problems

  • Konstantin Barkalov
  • Vasily Ryabov
  • Sergey Sidorov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6083)


This paper continues development of information-statistical approach to minimization of multiextremal functions in the case of non-convex constraints. Proposed approach is called index method. Solving multidimensional problem is reduced to solving equivalent single dimensional one. Dimension reduction is based on Peano curves that allow mapping multidimensional hyper cube onto the segment on real axis. We also use rotating Peano curves that allowed effectively parallelize algorithm to use hundreds of processors. Special attention was paid to mixed local-global strategy for algorithm convergence acceleration.


global optimization parallel computing index method local-global strategy 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Strongin, R.G.: Global Optimum Search. M.: Znanie (1990)Google Scholar
  2. 2.
    Strongin, R.G.: Parallel multiextremal optimization using multiple evolvents. J. Computational mathematics and mathematical physics 31(8), 1173–1185 (1991)zbMATHMathSciNetGoogle Scholar
  3. 3.
    Strongin, R.G., Barkalov, K.A.: About convergence of index method in problems of conditional optimizations with ε-reserving solutions Mathematical issues of cybernetics. M.: Nauka, pp. 273–288 (1999)Google Scholar
  4. 4.
    Strongin, R.G., Sergeyev, Y.D.: Global optimization with non-convex constraints. Sequential and parallel algorithms. Kluwer Academic Publishers, Dordrecht (2000)zbMATHGoogle Scholar
  5. 5.
    Barkalov, K.A., Strongin, R.G.: Global optimization method with adaptive order of checking constraints. J. Computational mathematics and mathematical physics 42(9), 1338–1350 (2002)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Barkalov, K.A.: Convergence acceleration for constrained global optimization problems. Printed Nizhni Novgorod State University, Nizhni Novgorod (2005)Google Scholar
  7. 7.
    Barkalov, K.A., Ryabov, V.V., Sidorov, S.V.: Using Peano curves in parallel global optimization. In: Materials of 9th International Conference-Seminal “High-Performance Computing on Cluster Systems”, Vladimir, pp. 44–47 (2009)Google Scholar
  8. 8.
    Strongin, R.G., Gergel, V.P., Barkalov, K.A.: Parallel methods of global optimization problems solving. Priborostroenie 52(10), 25–32 (2009)Google Scholar
  9. 9.
    Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. Journal of Optimization Theory and Applications (79), 157–181 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Gablonsky, M.J.: Modifications of the DIRECT Algorithm. Ph.D. thesis, North Carolina State University, Raleigh, NC (2001)Google Scholar
  11. 11.
    Gablonsky, M.J., Kelley, C.T.: A locally-biased form of the DIRECT Algorithm. Journal of Global Optimization 21, 27–37 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Gaviano, M., Kvasov, D.E., Lera, D., Sergeyev, Y.D.: Software for generation of classes of test functions with known local and global minima for global optimization. ACM TOMS 29(4), 469–480 (2003), zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Lera, D., Sergeyev, Y.D., Lipschitz, Hölder: Global optimization using space-filling curves. Applied Numerical Mathematics 60(1-2), 115–129 (2010)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Konstantin Barkalov
    • 1
  • Vasily Ryabov
    • 1
  • Sergey Sidorov
    • 1
  1. 1.Nizhni Novgorod State UniversityNizhni NovgorodRussia

Personalised recommendations