Abstract
On the basis of the method of nonuniform coverings, a parallel method for the global optimization of Lipschitzian functions is developed. This method is implemented in C-MPI for the global minimization of functions whose gradient satisfies the Lipschitz condition. The performance of the algorithm is demonstrated using the calculation of the structure of a protein molecule as an example.
Similar content being viewed by others
References
R. C. Strongin and Ya. D. Sergeyev, Global Optimization with Non-Convex Constraints. Sequential and Parallel Algorithms (Kluwer, Dordrecht, 2000).
V. V. Voevodin and Vl. V. Voevodin, Parallel Computations (BKhV-Peterburg, St. Petersburg, 2002) [in Russian].
Yu. G. Evtushenko, “A Numerical Method for Global Optimization of Functions (Search on a Nonuniform Grid),” Zh. Vychisl. Mat. Mat. Fiz. 11, 1390–1403 (1971).
Yu. G. Evtushenko and V. A. Rat’kin, “Bisection Method for the Global Optimization of Functions of Several Variables,” Izv. Ross. Akad. Nauk, Tekh. Kibern., No. 1, 119–127 (1987).
A. Ya. Belyankov, “Improving the Efficiency of Nonuniform Covering Methods in Global Optimization,” in Abstracts of the Conference on Mathematical Programming and Software (Ural’skoe Otdelenie Akad. Nauk SSSR, Sverdlovsk, 1989), pp. 21–22 [in Russian].
Yu. G. Evtushenko, V. U. Malkova, and A. A. Stanevichyus, “Parallelization of the Global Extremum Searching Process,” Avtom.Telemekh., No. 5, 46–58 (2007) [Autom. Remote Control 68, 787–798 (2007)].
Yu. Nesterov and B. Polyak, “Cubic Regularization of Newton Method and Its Global Performance,” Math. Program. 108(1), 177–205 (2006).
A. S. Strekalovsky, Elements of Nonconvex Optimization (Nauka, Novosibirsk, 2003) [in Russian].
A. Ya. Belyankov, “Preliminary Parallelipiped Partitioning in Nonuniform Covering Methods in Global Optimization,” II All-Russia Conf. with Youth Research School on Mathematical Modeling of Developing Economies (Vyatskii Gos. Univ., Kirov, 2007), pp. 59–62 [in Russian].
M. A. Posypkin and I. Kh. Sigal, “Investigation of Algorithms for Parallel Computations in Knapsack-Type Discrete Optimization Problems,” Zh. Vychisl. Mat. Mat. Fiz. 45(10), 1801–1809 (2005) [Comput. Math. Math. Phys. 45, 1735–1742 (2005)].
Joint Supercomputer Center of the Russian Academy of Sciences, httr://www.jsss.ru
Cambridge Cluster Database, http://www-wales.ch.cam.ac.uk/jon/structures/Morse.html.
Yu. G. Evtushenko and M. A. Potapov, “Methods for Solving Multicriteria Problems,” Dokl. Akad. Nauk SSSR 291, 25–29 (1986).
Yu. G. Evtushenko, “A Numerical Method for Finding Best Guaranteed Estimates,” Zh. Vychisl. Mat. Mat. Fiz. 12(1), 89–104 (1972).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © Yu.G. Evtushenko, V.U. Malkova, A.A. Stanevichyus, 2009, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2009, Vol. 49, No. 2, pp. 255–269.
Rights and permissions
About this article
Cite this article
Evtushenko, Y.G., Malkova, V.U. & Stanevichyus, A.A. Parallel global optimization of functions of several variables. Comput. Math. and Math. Phys. 49, 246–260 (2009). https://doi.org/10.1134/S0965542509020055
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0965542509020055