{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T19:16:33Z","timestamp":1770059793176,"version":"3.49.0"},"reference-count":46,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2021,9,28]],"date-time":"2021-09-28T00:00:00Z","timestamp":1632787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012190","name":"Ministry of Science and Higher Education of the Russian Federation","doi-asserted-by":"publisher","award":["075-15-2020-808"],"award-info":[{"award-number":["075-15-2020-808"]}],"id":[{"id":"10.13039\/501100012190","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This paper features the study of global optimization problems and numerical methods of their solution. Such problems are computationally expensive since the objective function can be multi-extremal, nondifferentiable, and, as a rule, given in the form of a \u201cblack box\u201d. This study used a deterministic algorithm for finding the global extremum. This algorithm is based neither on the concept of multistart, nor nature-inspired algorithms. The article provides computational rules of the one-dimensional algorithm and the nested optimization scheme which could be applied for solving multidimensional problems. Please note that the solution complexity of global optimization problems essentially depends on the presence of multiple local extrema. In this paper, we apply machine learning methods to identify regions of attraction of local minima. The use of local optimization algorithms in the selected regions can significantly accelerate the convergence of global search as it could reduce the number of search trials in the vicinity of local minima. The results of computational experiments carried out on several hundred global optimization problems of different dimensionalities presented in the paper confirm the effect of accelerated convergence (in terms of the number of search trials required to solve a problem with a given accuracy).<\/jats:p>","DOI":"10.3390\/e23101272","type":"journal-article","created":{"date-parts":[[2021,9,28]],"date-time":"2021-09-28T21:38:09Z","timestamp":1632865089000},"page":"1272","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Acceleration of Global Optimization Algorithm by Detecting Local Extrema Based on Machine Learning"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5273-2471","authenticated-orcid":false,"given":"Konstantin","family":"Barkalov","sequence":"first","affiliation":[{"name":"Department of Mathematical Software and Supercomputing Technologies, Lobachevsky University, 603950 Nizhny Novgorod, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8736-0652","authenticated-orcid":false,"given":"Ilya","family":"Lebedev","sequence":"additional","affiliation":[{"name":"Department of Mathematical Software and Supercomputing Technologies, Lobachevsky University, 603950 Nizhny Novgorod, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6776-0096","authenticated-orcid":false,"given":"Evgeny","family":"Kozinov","sequence":"additional","affiliation":[{"name":"Department of Mathematical Software and Supercomputing Technologies, Lobachevsky University, 603950 Nizhny Novgorod, Russia"}]}],"member":"1968","published-online":{"date-parts":[[2021,9,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/gigascience\/giaa128","article-title":"Trajectories, bifurcations, and pseudo-time in large clinical datasets: Applications to myocardial infarction and diabetes data","volume":"9","author":"Golovenkin","year":"2020","journal-title":"GigaScience"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"7043","DOI":"10.1038\/s41598-019-43465-3","article-title":"Employing machine learning for theory validation and identification of experimental conditions in laser-plasma physics","volume":"9","author":"Gonoskov","year":"2019","journal-title":"Sci. Rep."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"123115","DOI":"10.1063\/1.5128372","article-title":"Bayesian framework for simulation of dynamical systems from multidimensional data using recurrent neural network","volume":"29","author":"Seleznev","year":"2019","journal-title":"Chaos"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1109\/72.712178","article-title":"Artificial neural networks for solving ordinary and partial differential equations","volume":"9","author":"Lagaris","year":"1998","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"e202100006","DOI":"10.1002\/gamm.202100006","article-title":"Three ways to solve partial differential equations with neural networks\u2014A review","volume":"44","author":"Blechschmidt","year":"2021","journal-title":"GAMM Mitteilungen"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"013133","DOI":"10.1063\/1.5132840","article-title":"Solving Fokker\u2013Planck equation using deep learning","volume":"30","author":"Xu","year":"2020","journal-title":"Chaos"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02592070","article-title":"Stochastic global optimization methods part I: Clustering methods","volume":"39","author":"Timmer","year":"1987","journal-title":"Math. Program."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10589-010-9330-x","article-title":"Machine learning for global optimization","volume":"51","author":"Cassioli","year":"2012","journal-title":"Comput. Optim. Appl."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Archetti, F., and Candelieri, A. (2019). Bayesian Optimization and Data Science, Springer.","DOI":"10.1007\/978-3-030-24494-1"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Zhigljavsky, A., and \u017dilinskas, A. (2021). Bayesian and High-Dimensional Global Optimization, Springer.","DOI":"10.1007\/978-3-030-64712-4"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00500-003-0328-5","article-title":"A comprehensive survey of fitness approximation in evolutionary computation","volume":"9","author":"Jin","year":"2005","journal-title":"Soft Comput."},{"key":"ref_12","first-page":"245","article-title":"Metaheuristic vs. deterministic global optimization algorithms: The univariate case","volume":"318","author":"Kvasov","year":"2018","journal-title":"Appl. Math. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1038\/s41598-017-18940-4","article-title":"On the efficiency of nature-inspired metaheuristics in expensive global optimization with limited budget","volume":"8","author":"Sergeyev","year":"2018","journal-title":"Sci. Rep."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Strongin, R.G., and Sergeyev, Y.D. (2000). Global Optimization with Non-Convex Constraints. Sequential and Parallel Algorithms, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-4677-1"},{"key":"ref_15","first-page":"1289","article-title":"A global optimization technique with an adaptive order of checking for constraints","volume":"42","author":"Barkalov","year":"2002","journal-title":"Comput. Math. Math. Phys."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2469","DOI":"10.1007\/s11590-020-01668-y","article-title":"Computationally efficient approach for solving lexicographic multicriteria optimization problems","volume":"15","author":"Gergel","year":"2020","journal-title":"Optim. Lett."},{"key":"ref_17","first-page":"224","article-title":"Solving multidimensional global optimization problems using graphics accelerators","volume":"687","author":"Barkalov","year":"2016","journal-title":"Commun. Comput. Inf. Sci."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"47","DOI":"10.3934\/naco.2018003","article-title":"A novel supercomputer software system for solving time-consuming global optimization problems","volume":"8","author":"Gergel","year":"2018","journal-title":"Numer. Algebr. Control Optim."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1134\/S1995080218040133","article-title":"Generalized Parallel Computational Schemes for Time-Consuming Global Optimization","volume":"39","author":"Strongin","year":"2018","journal-title":"Lobachevskii J. Math."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00941892","article-title":"Lipschitzian optimization without the Lipschitz constant","volume":"79","author":"Jones","year":"1993","journal-title":"J. Optim. Theory Appl."},{"key":"ref_21","unstructured":"Pinter, J. (1996). Global Optimization in Action (Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications), Kluwer Academic Publishers."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3846\/1392-6292.2008.13.145-159","article-title":"Branch and bound with simplicial partitions for global optimization","volume":"13","year":"2008","journal-title":"Math. Model. Anal."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1134\/S0965542509020055","article-title":"Parallel global optimization of functions of several variables","volume":"49","author":"Evtushenko","year":"2009","journal-title":"Comput. Math. Math. Phys."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"17715","DOI":"10.1007\/s00500-020-05030-3","article-title":"Safe global optimization of expensive noisy black-box functions in the \u03b4-Lipschitz framework","volume":"24","author":"Sergeyev","year":"2020","journal-title":"Soft Comput."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Jones, D. (2009). The DIRECT global optimization algorithm. The Encyclopedia of Optimization, Springer.","DOI":"10.1007\/978-0-387-74759-0_128"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s11590-009-0156-3","article-title":"Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds","volume":"4","author":"Grothey","year":"2010","journal-title":"Optim. Lett."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1007\/s11590-012-0452-1","article-title":"A deterministic approach to global box-constrained optimization","volume":"7","author":"Evtushenko","year":"2013","journal-title":"Optim. Lett."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1134\/S0005117913090014","article-title":"Lipschitz global optimization methods in control problems","volume":"74","author":"Kvasov","year":"2013","journal-title":"Autom. Remote Control"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s11590-014-0772-4","article-title":"Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints","volume":"10","year":"2016","journal-title":"Optim. Lett."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"113052","DOI":"10.1016\/j.eswa.2019.113052","article-title":"Globally-biased BIRECT algorithm with local accelerators for expensive global optimization","volume":"144","author":"Sergeyev","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Paulavi\u010dius, R., and \u017dilinskas, J. (2014). Simplicial Global Optimization, Springer.","DOI":"10.1007\/978-1-4614-9093-7"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Sergeyev, Y.D., and Kvasov, D.E. (2017). Deterministic Global Optimization: An Introduction to the Diagonal Approach, Springer.","DOI":"10.1007\/978-1-4939-7199-2"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Sergeyev, Y.D., Strongin, R.G., and Lera, D. (2013). Introduction to Global Optimization Exploiting Space-Filling Curves, Springer.","DOI":"10.1007\/978-1-4614-8042-6"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/opre.48.3.390.12436","article-title":"Nested partitions method for global optimization","volume":"48","author":"Shi","year":"2000","journal-title":"Oper. Res."},{"key":"ref_35","first-page":"123","article-title":"Parallel asynchronous global search and the nested optimization scheme","volume":"3","author":"Sergeyev","year":"2001","journal-title":"J. Comput. Anal. Appl."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10898-009-9426-y","article-title":"One-dimensional nested maximin designs","volume":"46","author":"Husslage","year":"2010","journal-title":"J. Glob. Optim."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1016\/j.procs.2015.05.216","article-title":"Local tuning in nested scheme of global optimization","volume":"51","author":"Gergel","year":"2015","journal-title":"Procedia Comput. Sci."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10898-015-0355-7","article-title":"Adaptive nested optimization scheme for multidimensional global search","volume":"66","author":"Gergel","year":"2016","journal-title":"J. Glob. Optim."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"060011","DOI":"10.1063\/1.4965345","article-title":"Comparative efficiency of dimensionality reduction schemes in global optimization","volume":"1776","author":"Grishagin","year":"2016","journal-title":"AIP Conf. Proc."},{"key":"ref_40","unstructured":"Breiman, L., Friedman, J., Stone, C., and Olshen, R. (1984). Classification and Regression Trees, CRC Press."},{"key":"ref_41","unstructured":"Press, W., Teukolsky, S., Vetterling, W., and Flannery, B. (2007). Numerical Recipes: The Art of Scientific Computing, Cambridge University Press."},{"key":"ref_42","first-page":"270","article-title":"Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes","volume":"318","author":"Grishagin","year":"2018","journal-title":"Appl. Math. Comput."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s10898-020-00952-6","article-title":"The DIRECT algorithm: 25 years Later","volume":"79","author":"Jones","year":"2021","journal-title":"J. Glob. Optim."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/962437.962444","article-title":"Software for generation of classes of test functions with known local and global minima for global optimization","volume":"29","author":"Gaviano","year":"2003","journal-title":"ACM Trans. Math. Softw."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/978-3-030-40616-5_38","article-title":"On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods","volume":"11974","author":"Kvasov","year":"2020","journal-title":"Lect. Notes Comput. Sci."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"113134","DOI":"10.1016\/j.cam.2020.113134","article-title":"Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives","volume":"383","author":"Sergeyev","year":"2021","journal-title":"J. Comput. Appl. Math."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/10\/1272\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:06:58Z","timestamp":1760166418000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/10\/1272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,28]]},"references-count":46,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2021,10]]}},"alternative-id":["e23101272"],"URL":"https:\/\/doi.org\/10.3390\/e23101272","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,28]]}}}