Abstract
Methods for solving the multidimensional multiextremal optimization problems using the nested optimization scheme are considered. A novel approach for solving the multidimensional multiextremal problems based on the adaptive nested optimization has been proposed. This approach enables to develop methods of the global optimum search which are more efficient in comparison with the ones on the base of the traditional nested optimization scheme. The new approach provides advantages due to better usage of the information on the problem in the course of optimization. A general scheme of a adaptive nested optimization is described. A theoretical substantiation of the method convergence is given for the case when for solving the univariate subproblems within the nested scheme an information algorithm of global search is used. Results of numerical experiments on the well-known classes of the test multiextremal functions confirming the efficiency of the proposed scheme are presented.
Similar content being viewed by others
References
Butz, A.R.: Space-filling curves and mathematical programming. Inform. Control 12(4), 314–330 (1968)
Carr, C.R., Howe, C.W.: Quantitative Decision Procedures in Management and Economic: Deterministic Theory and Applications. McGraw-Hill, New York (1964)
Dam, E.R., Husslage, B., Hertog, D.: One-dimensional nested maximin designs. J. Glob. Optim. 46(2), 287–306 (2010)
Floudas, C.A., Gounaris, C.E.: A review of recent advances in global optimization. J. Glob. Optim. 45(1), 3–38 (2009)
Floudas, C.A., Pardalos, P.M. (eds.): Encyclopedia of Optimization. Kluwer Academic Publishers, Dordrecht (2001) (The 2nd ed. Springer, 2009)
Gaviano, M., Kvasov, D.E., Lera, D., Sergeyev, YaD: Software for generation of classes of test functions with known local and global minima for global optimization. ACM TOMS 29(4), 469–480 (2003)
Gergel, V.P., Strongin, R.G.: Parallel computing for globally optimal decision making. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2763, pp. 76–88 (2003)
Gergel, V., Grishagin, V., Israfilov, R.: Local tuning in nested scheme of global optimization. Procedia Comput. Sci. 51, 865–874 (2015)
Goertzel, B.: Global optimization with space-filling curves. Appl. Math. Lett. 12(8), 133–135 (1999)
Grishagin, V.A.: Operating characteristics of some global search algorithms. Probl. Stat. Optim. 7, 198–206. Zinatne, Riga (1978) (In Russian)
Grishagin, V.A., Sergeyev, Y.D., Strongin, R.G.: Parallel characteristic algorithms for solving problems of global optimization. J. Glob. Optim. 10(2), 185–206 (1997)
Grishagin, V.A., Strongin, R.G.: Optimization of multiextremal functions subject to monotonically unimodal constraints. Eng. Cybern. 5, 117–122 (1984)
Hime, A.E., Oliveira Jr, H.A., Petraglia, A.: Global optimization using space-filling curves and measure-preserving transformations. Soft Comput. Ind. Appl. 96, 121–130 (2011)
Horst, R., Pardalos, P.M. (eds.): Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht (1995)
Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Kluwer Academic Publishers, Dordrecht (1995). (2nd ed. Kluwer Academic Publishers, 2001)
Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Berlin (1990)
Jones, D.R.: The DIRECT global optimization algorithm. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization 1, pp. 431–440. Kluwer Academic Publishers, Dordrecht (2001)
Kushner, H.J.: A new method of locating the maximum point of an arbitrary multipeak curve in the presence of noise. Transactions of ASME, Ser. D. J. Basic Eng. 86(1), 97–106 (1964)
Kvasov, D.E., Pizzuti, C., Sergeyev, Y.D.: Local tuning and partition strategies for diagonal GO methods. Numerische Matematik 94(1), 93–106 (2003)
Kvasov, D.E., Sergeyev, YaD: Multidimensional global optimization algorithm based on adaptive diagonal curves. Comput. Math. Math. Phys. 43(1), 40–56 (2003)
Kvasov, D.E., Sergeyev, Y.D.: Lipschitz gradients for global optimization in a one-point-based partitioning scheme. J. Comput. Appl. Math. 236(16), 4042–4054 (2012)
Kvasov, D.E., Sergeyev, YaD: Deterministic approaches for solving practical black-box global optimization problems. Adv. Eng. Softw. 80, 58–66 (2015)
Paulavicius, R., Sergeyev, Y.D., Kvasov, D.E., Zilinskas, J.: Globally-biased DISIMPL algorithm for expensive global optimization. J. Glob. Optim. 59(2–3), 545–567 (2014)
Pintér, J.D.: Global Optimization in Action (Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications). Kluwer Academic Publishers, Dordrecht (1996)
Piyavskij, S.A.: An algorithm for finding the absolute extremum of a function. USSR Comput. Math. Math. Phys. 12(4), 57–67 (1972)
Sergeyev, Y.D., Grishagin, V.A.: A parallel method for finding the global minimum of univariate functions. J. Optim. Theory Appl. 80(3), 513–536 (1994)
Sergeyev, Y.D.: An efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms. J. Optim. Theory Appl. 107(1), 145–168 (2000)
Sergeyev, Y.D., Grishagin, V.A.: Parallel asynchronous global search and the nested optimization scheme. J. Comput. Anal. Appl. 3(2), 123–145 (2001)
Sergeyev, Ya.D.: Efficient partition of N-dimensional intervals in the framework of one-point-based algorithms. J. Optim. Theory Appl. 124(2), 503–510 (2005)
Sergeyev, Ya.D., Strongin, R.G., Lera, D.: Introduction to Global Optimization Exploiting Space-Filling Curves. Springer, Berlin (2013)
Shi, L., Ólafsson, S.: Nested partitions method for global optimization. Oper. Res. 48(3), 390–407 (2000)
Shubert, B.O.: A sequential method seeking the global maximum of a function. SIAM J. Numer. Anal. 9(3), 379–388 (1972)
Strekalovsky, A.S.: On solving optimization problems with hidden nonconvex structures. In: Rassias, T.M., Floudas, C.A., Butenko, S. (eds.) Optimization and Science in Engineering, pp. 465–502. Springer, Berlin (2014)
Strongin, R.G.: Numerical Methods in Multiextremal Problems (Information-Statistical Algorithms). Nauka, Moscow (1978). (In Russian)
Strongin, R.G.: The information approach to multiextremal optimization problems. Stoch. Stoch. Rep. 27, 65–82 (1989)
Strongin, R.G., Sergeyev, Ya.D.: Global Optimization with Non-convex Constraints: Sequential and Parallel Algorithms. Kluwer Academic Publishers, Dordrecht (2000, 2nd ed. 2013, 3rd ed. 2014)
Törn, A., Z̆ilinskas, A.: Global Optimization. Lecture Notes in Computer Science 350. Springer, Berlin (1989)
Zhigljavsky, A.A.: Theory of Global Random Search. Kluwer Academic Publishers, Dordrecht (1991)
Zhigljavsky, A.A., Chekmasov, M.V.: Comparison of independent, stratified and random covering sample schemes in optimization problems. Math. Comput. Model. 23(8–9), 97–110 (1996)
Acknowledgments
The authors thank Ruslan Israfilov for a significant contribution to computational experiments. The revised version of the paper was supported by the Russian Science Foundation, project No. 15-11-30022 “Global optimization, supercomputing computations, and applications”.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gergel, V., Grishagin, V. & Gergel, A. Adaptive nested optimization scheme for multidimensional global search. J Glob Optim 66, 35–51 (2016). https://doi.org/10.1007/s10898-015-0355-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-015-0355-7