Skip to main content
SpringerLink
Log in

Parallelization of the global extremum searching process

  • Topical Issue
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

The parallel algorithm for searching the global extremum of the function of several variables is designed. The algorithm is based on the method of nonuniform coverings proposed by Yu.G. Evtushenko for functions that comply with the Lipschitz condition. The algorithm is realized in the language C and message passing interface (MPI) system. To speed up computations, auxiliary procedures for founding the local extremum are used. The operation of the algorithm is illustrated by the example of atomic cluster structure calculations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Strongin, R.G. and Sergeyev, Ya.D, Global Optimization with Non-Convex Constraints. Sequential and Parallel Algorithms, Dordrecht: Academic, 2000.

    MATH  Google Scholar 

  2. Voevodin, V.V. and Voevodin, Vl.V., Parallel’nye vychisleniya (Parallel Computing), St. Petersburg: BKhV-Peterburg, 2002.

    Google Scholar 

  3. Evtushenko, Yu.G., Numerical Method for Finding the Global Extremum of a Function (Enumeration of a Nonuniform Grid), Zh. Vychisl. Mat. Mat. Fiz., 1971, vol. 11, no. 6, pp. 1390–1403.

    MATH  Google Scholar 

  4. Evtushenko, Yu.G. and Rat’kin, V.A., The Half-Division Method for the Global Function of Several Variables, Tekh. Kibern., 1987, no. 1, pp. 119–127.

  5. Belyankov, A.Ya., Numerical Efficiency Increase for Methods of Nonuniform Covering in Global Optimization, in Metody matematicheskogo programmirovaniya i programmnoe obespechenie. Tezisy dokl. (Mathematical Programming Methods and Software. Theses Rep.), Sverdlovsk: Akad. Nauk SSSR, 1989, pp. 21–22.

    Google Scholar 

  6. Interdepartmental Supercomputer Center of the Russian Academy of Sciences, website: http://www.jscc.ru.

  7. Posypkin, M.A. and Sigal, I.Kh., Investigation of Algorithms for Parallel Computations in Knapsack-Type Discrete Optimization Problems, Zh. Vychisl. Mat. Mat. Fiz., 2005, vol. 45, no. 10, pp. 1801–1809.

    MATH  MathSciNet  Google Scholar 

  8. Evtushenko, Yu.G. and Potapov, M.A., Solution Methods for Multicreiterion Problems, Dokl. Akad. Nauk SSSR, 1986, vol. 291, no. 1, pp. 25–29.

    MathSciNet  Google Scholar 

  9. Evtushenko, Yu.G., Numerical Method for Finding the Best Guaranteed Estimates, Zh. Vychisl. Mat. Mat. Fiz., 1972, vol. 12, no. 1, pp. 89–104.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dorodnitsyn Computer Center, Russian Academy of Sciences, Moscow, Russia

    Yu. G. Evtushenko, V. U. Malkova & A. A. Stanevichyus

Authors
  1. Yu. G. Evtushenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. U. Malkova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. A. Stanevichyus
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © Yu.G. Evtushenko, V.U. Malkova, A.A. Stanevichyus, 2007, published in Avtomatika i Telemekhanika, 2007, No. 5, pp. 46–58.

This work was supported by Program no. 14 of basic research of the Presidium of the Russian Academy of Sciences “Section 2: High-Performance Computing and Multiprocessor Systems” in 2006 and Program no. 15 of the Presidium of the Russian Academy of Sciences “Investigation and Design of Scientific Applications in the Distributed Supercomputing Environment at the Computing Centre of the Russian Academy of Sciences” in 2006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Evtushenko, Y.G., Malkova, V.U. & Stanevichyus, A.A. Parallelization of the global extremum searching process. Autom Remote Control 68, 787–798 (2007). https://doi.org/10.1134/S0005117907050062

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117907050062

PACS number

Search

Navigation