{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:29:28Z","timestamp":1772119768883,"version":"3.50.1"},"reference-count":97,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T00:00:00Z","timestamp":1708560000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T00:00:00Z","timestamp":1708560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876199"],"award-info":[{"award-number":["61876199"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Huawei Technologies Co., Ltd.","award":["YJCB2011003HI"],"award-info":[{"award-number":["YJCB2011003HI"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s11075-024-01768-1","type":"journal-article","created":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T06:06:19Z","timestamp":1708581979000},"page":"1715-1790","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Continuation Newton methods with deflation techniques for global optimization problems"],"prefix":"10.1007","volume":"97","author":[{"given":"Xin-long","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hang","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,22]]},"reference":[{"key":"1768_CR1","doi-asserted-by":"crossref","unstructured":"Abbott, J.P.: Numerical continuation methods for nonlinear equations and bifurcation problems. Ph.D. Thesis, Computer Center, Australian National University 1977","DOI":"10.1017\/S0004972700010546"},{"key":"1768_CR2","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Optim. 10, 147\u2013161 (2008)","journal-title":"Adv. Model. Optim."},{"key":"1768_CR3","unstructured":"Adorio, E.P., Diliman, U.P.: MVF-multivariate test functions library in C for unconstrained global optimization. (2005) available at http:\/\/www.geocities.ws\/eadorio\/mvf.pdf"},{"key":"1768_CR4","doi-asserted-by":"crossref","first-page":"1445","DOI":"10.1002\/(SICI)1096-987X(199810)19:13<1445::AID-JCC2>3.0.CO;2-Q","volume":"19","author":"I Andricioaei","year":"1998","unstructured":"Andricioaei, I., Straub, J.E.: Global optimization using bad derivatives: derivative-free method for molecular energy minimization. J. Comput. Chem. 19, 1445\u20131455 (1998)","journal-title":"J. Comput. Chem."},{"key":"1768_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719154","volume-title":"Introduction to numerical continuation methods","author":"EL Allgower","year":"2003","unstructured":"Allgower, E.L., Georg, K.: Introduction to numerical continuation methods. SIAM, Philadelphia, PA (2003)"},{"key":"1768_CR6","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971392","volume-title":"Computer methods for ordinary differential equations and differential-algebraic equations","author":"UM Ascher","year":"1998","unstructured":"Ascher, U.M., Petzold, L.R.: Computer methods for ordinary differential equations and differential-algebraic equations. SIAM, Philadelphia, PA (1998)"},{"key":"1768_CR7","doi-asserted-by":"crossref","first-page":"2621","DOI":"10.1016\/j.camwa.2015.07.024","volume":"70","author":"O Axelsson","year":"2015","unstructured":"Axelsson, O., Sysala, S.: Continuation Newton methods. Comput. Math. Appl. 70, 2621\u20132637 (2015)","journal-title":"Comput. Math. Appl."},{"key":"1768_CR8","doi-asserted-by":"crossref","unstructured":"Averick, B.\u00a0M., Carter, R.\u00a0G., Mor\u00e9, J.\u00a0J., Xue, G.\u00a0L.: The MINIPACK-2 test problem collection, Mathematics and Computer Science Division, Agronne National Laboratory, Preprint MCS-P153-0692, 1992","DOI":"10.2172\/79972"},{"key":"1768_CR9","first-page":"5595","volume":"18","author":"AG Baydin","year":"2017","unstructured":"Baydin, A.G., Pearlmutter, B.A., Radul, A.A., Siskind, J.M.: Automatic differentiation in machine learning: a survey. J. Mach. Learn. Res. 18, 5595\u20135637 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"1768_CR10","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"1768_CR11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02591684","volume":"37","author":"CGE Boender","year":"1987","unstructured":"Boender, C.G.E.: Bayesian stopping rules for multistart global optimization methods. Math. Program. 37, 59\u201380 (1987)","journal-title":"Math. Program."},{"key":"1768_CR12","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1147\/rd.165.0504","volume":"16","author":"FH Branin","year":"1972","unstructured":"Branin, F.H.: Widely convergent method for finding multiple solutions of simultaneous nonlinear equations. IBM J. Res. Dev. 16, 504\u2013521 (1972)","journal-title":"IBM J. Res. Dev."},{"key":"1768_CR13","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/BF02165004","volume":"16","author":"KM Brown","year":"1971","unstructured":"Brown, K.M., Gearhart, W.B.: Deflation techniques for the calculation of further solutions of a nonlinear system. Numer. Math. 16, 334\u2013342 (1971)","journal-title":"Numer. Math."},{"key":"1768_CR14","unstructured":"Braden, A.: Optimisation techniques for solving design problems in modern trombones. In: Forum Acusticum 557\u2013662 (2005)"},{"key":"1768_CR15","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N., Toint, Ph.L.: Trust-region methods. SIAM, Philadelphia, PA (2000)","DOI":"10.1137\/1.9780898719857"},{"key":"1768_CR16","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction derivative-free optimization","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction derivative-free optimization. SIAM, Philadelphia, PA (2009)"},{"key":"1768_CR17","unstructured":"Couenne.: a solver for non-convex MINLP problems, available at https:\/\/www.coin-or.org\/Couenne\/, February (2020)"},{"key":"1768_CR18","unstructured":"CMA-ES.: the covariance matrix adaptation evolution strategy, available at http:\/\/www.cmap.polytechnique.fr\/~nikolaus.hansen\/cmaes.m, (2012)"},{"key":"1768_CR19","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/99.714603","volume":"5","author":"J Czyzyk","year":"1998","unstructured":"Czyzyk, J., Mesnier, M.P., Mor\u00e9, J.J.: The NEOS Server. IEEE Comput. Sci. Eng. 5, 68\u201375 (1998)","journal-title":"IEEE Comput. Sci. Eng."},{"key":"1768_CR20","doi-asserted-by":"publisher","unstructured":"Cust\u00f3dio, Madeira, J.F.A.: GLODS: global and local optimization using direct search. J. Glob. Optim. 62, 1\u201328 (2015). https:\/\/doi.org\/10.1007\/s10898-014-0224-9","DOI":"10.1007\/s10898-014-0224-9"},{"key":"1768_CR21","first-page":"601","volume":"88","author":"DF Davidenko","year":"1953","unstructured":"Davidenko, D.F.: On a new method of numerical solution of systems of nonlinear equations (in Russian). Dokl. Akad. Nauk SSSR 88, 601\u2013602 (1953)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"1768_CR22","volume-title":"Newton methods for nonlinear problems: affine invariance and adaptive algorithms","author":"P Deuflhard","year":"2004","unstructured":"Deuflhard, P.: Newton methods for nonlinear problems: affine invariance and adaptive algorithms. Springer-Verlag, Berlin (2004)"},{"key":"1768_CR23","doi-asserted-by":"crossref","unstructured":"Dolan, E.D.: The NEOS Server 4.0 administrative guide, Technical Memorandum ANL\/MCS-TM-250, Mathematics and Computer Science Division. Argonne National Laboratory (2001)","DOI":"10.2172\/822567"},{"key":"1768_CR24","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program 91, 201\u2013213 (2002)","journal-title":"Math. Program"},{"key":"1768_CR25","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01395950","volume":"26","author":"P Deuflhard","year":"1975","unstructured":"Deuflhard, P., Pesch, H.J., Rentrop, P.: A modified continuation method for the numerical solution of nonlinear two-point boundary value problems by shooting techniques. Numer. Math. 26, 327\u2013343 (1975)","journal-title":"Numer. Math."},{"key":"1768_CR26","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971200","volume-title":"Numerical methods for unconstrained optimization and nonlinear equations","author":"JE Dennis","year":"1996","unstructured":"Dennis, J.E., Schnabel, R.B.: Numerical methods for unconstrained optimization and nonlinear equations. SIAM, Philadelphia, PA (1996)"},{"key":"1768_CR27","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1007\/s00158-016-1450-1","volume":"54","author":"HC Dong","year":"2016","unstructured":"Dong, H.C., Song, B.W., Dong, Z.M., Wang, P.: Multi-start space reduction (MSSR) surrogate-based global optimization method. Struct. Multidisc. Optim. 54, 907\u2013926 (2016)","journal-title":"Struct. Multidisc. Optim."},{"key":"1768_CR28","unstructured":"Elhara, O., Varelas, K., Nguyen, D., Tusar, T., Brockhoff, D., Hansen, N., Auger, A.: COCO: The large scale black-box optimization benchmarking (bbob-largescale) Test Suite, arXiv preprint available at https:\/\/arxiv.org\/abs\/1903.06396 (2019)"},{"key":"1768_CR29","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1504\/IJEHV.2007.014447","volume":"1","author":"W Gao","year":"2007","unstructured":"Gao, W., Mi, C.: Hybrid vehicle design using global optimisation algorithms. Int. J. Electric Hybrid Veh. 1, 57\u201370 (2007)","journal-title":"Int. J. Electric Hybrid Veh."},{"key":"1768_CR30","unstructured":"Gropp, W., Mor\u00e9, J. J.: Optimization environments and the NEOS server. In: Buhmann, M.D., Iserles, A. (eds.) Approximation Theory and Optimization, Cambridge University Press, (1997)"},{"key":"1768_CR31","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix computation","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix computation, 4th edn. The John Hopkins University Press, Baltimore (2013)","edition":"4"},{"key":"1768_CR32","doi-asserted-by":"crossref","unstructured":"Griewank, A., Walther, A.: Evaluating derivatives: principles and techniques of algorithmic differentiation, SIAM, Philadelphia, (2008). https:\/\/doi.org\/10.1137\/1.9780898717761","DOI":"10.1137\/1.9780898717761"},{"key":"1768_CR33","doi-asserted-by":"crossref","unstructured":"Gould, N.I.M, Orban, D., Toint, Ph.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl.60, 545\u2013557 (2015). https:\/\/www.cuter.rl.ac.uk\/mastsif.html","DOI":"10.1007\/s10589-014-9687-3"},{"key":"1768_CR34","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/3-540-32494-1_4","volume-title":"Towards a new evolutionary computation","author":"N Hansen","year":"2006","unstructured":"Hansen, N.: The CMA evolution strategy: a comparing review. In: Lozano, J.A., Larranaga, P., Inza, I., Bengoetxea, E. (eds.) Towards a new evolutionary computation, pp. 75\u2013102. Advances on Estimation of Distribution Algorithms, Springer, Berlin (2006)"},{"key":"1768_CR35","unstructured":"Hansen, N.: The CMA evolution strategy: a tutorial, available at https:\/\/arxiv.org\/abs\/1604.00772 (2010)"},{"key":"1768_CR36","doi-asserted-by":"crossref","unstructured":"Hansen, C.H., Simpson, M.T., Cazzolato, B.S.: Active sound and vibration control: theory and applications, chapter 9: genetic algorithms for optimising ASVC systems, pp. 185-220, No. 62 in IEE control engineering series, London, UK (2002)","DOI":"10.1049\/PBCE062E_ch9"},{"key":"1768_CR37","unstructured":"Hart, W.E.: Adaptive global optimization with local search, Ph.D. dissertation, University of California, San Diego, CA, USA, (1994)"},{"key":"1768_CR38","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/S0036142998335972","volume":"37","author":"DJ Higham","year":"1999","unstructured":"Higham, D.J.: Trust region algorithms and timestep selection. SIAM J. Numer. Anal. 37, 194\u2013210 (1999)","journal-title":"SIAM J. Numer. Anal."},{"key":"1768_CR39","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1023\/A:1008382309369","volume":"14","author":"W Huyer","year":"1999","unstructured":"Huyer, W., Neumaier, A.: Global optimization by multilevel coordinate search. J. Glob. Optim. 14, 331\u2013355 (1999)","journal-title":"J. Glob. Optim."},{"key":"1768_CR40","doi-asserted-by":"crossref","unstructured":"Hairer, E., Wanner, G.: Solving ordinary differential equations II. Stiff and differential-algebraic problems, 2nd edn. Springer-Verlag, Berlin (1996)","DOI":"10.1007\/978-3-642-05221-7_1"},{"key":"1768_CR41","doi-asserted-by":"crossref","DOI":"10.1002\/9780470522165","volume-title":"General linear methods for ordinary differential equations","author":"Z Jackiewicz","year":"2009","unstructured":"Jackiewicz, Z.: General linear methods for ordinary differential equations. John Wiley & Sons Inc, Hoboken, New Jersey (2009)"},{"key":"1768_CR42","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2495-0","volume-title":"Rigorous global search: continuous problems","author":"RB Kearfott","year":"1996","unstructured":"Kearfott, R.B.: Rigorous global search: continuous problems. Nonconvex Optimization and Applications, Kluwer Academic, Dordrecht (1996)"},{"key":"1768_CR43","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718898","volume-title":"Solving nonlinear equations with Newton\u2019s method","author":"CT Kelley","year":"2003","unstructured":"Kelley, C.T.: Solving nonlinear equations with Newton\u2019s method. SIAM, Philadelphia, PA (2003)"},{"key":"1768_CR44","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1017\/S0962492917000113","volume":"27","author":"CT Kelley","year":"2018","unstructured":"Kelley, C.T.: Numerical methods for nonlinear equations. Acta Numer. 27, 207\u2013287 (2018)","journal-title":"Acta Numer."},{"key":"1768_CR45","doi-asserted-by":"crossref","unstructured":"Kimiaei, M., Neumaier, A.: Efficient unconstrained black box optimization, Math. Program. Comput. 14 (2022), 365-414. https:\/\/doi.org\/10.1007\/s12532-021-00215-9. Software available at https:\/\/arnold-neumaier.at\/software\/VRBBO\/","DOI":"10.1007\/s12532-021-00215-9"},{"key":"1768_CR46","doi-asserted-by":"crossref","first-page":"4042","DOI":"10.1016\/j.cam.2012.02.020","volume":"236","author":"DE Kvasov","year":"2012","unstructured":"Kvasov, D.E., Sergeyev, Y.D.: Lipschitz gradients for global optimization in a one-point-based partitioning scheme. J. Comput. Appl. Math. 236, 4042\u20134054 (2012)","journal-title":"J. Comput. Appl. Math."},{"key":"1768_CR47","unstructured":"Lambert, J.D.: Computational methods in ordinary differential equations. John Wiley, (1973)"},{"key":"1768_CR48","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/B:NUMA.0000021763.84725.b9","volume":"35","author":"C Lavor","year":"2004","unstructured":"Lavor, C., Maculan, N.: A function to test methods applied to global minimization of potential energy of molecules. Numer. Algorithms 35, 287\u2013300 (2004)","journal-title":"Numer. Algorithms"},{"key":"1768_CR49","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/4235.910464","volume":"5","author":"Y-W Leung","year":"2001","unstructured":"Leung, Y.-W., Wang, Y.P.: An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans. Evol. Comput. 5, 41\u201353 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1768_CR50","doi-asserted-by":"crossref","first-page":"1851","DOI":"10.1016\/j.laa.2009.12.023","volume":"432","author":"S-T Liu","year":"2010","unstructured":"Liu, S.-T., Luo, X.-L.: A method based on Rayleigh quotient gradient flow for extreme and interior eigenvalue problems. Linear Algebra Appl. 432, 1851\u20131863 (2010)","journal-title":"Linear Algebra Appl."},{"key":"1768_CR51","first-page":"153","volume":"23","author":"X-L Luo","year":"2005","unstructured":"Luo, X.-L.: Singly diagonally implicit Runge-Kutta methods combining line search techniques for unconstrained optimization. J. Comput. Math. 23, 153\u2013164 (2005)","journal-title":"J. Comput. Math."},{"key":"1768_CR52","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10957-008-9469-0","volume":"140","author":"X-L Luo","year":"2009","unstructured":"Luo, X.-L., Kelley, C.T., Liao, L.-Z., Tam, H.-W.: Combining trust region techniques and Rosenbrock methods to compute stationary points. J. Optim. Theory Appl. 140, 265\u2013286 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"1768_CR53","first-page":"1752","volume":"216","author":"X-L Luo","year":"2010","unstructured":"Luo, X.-L.: A second-order pseudo-transient method for steady-state problems. Appl. Math. Comput. 216, 1752\u20131762 (2010)","journal-title":"Appl. Math. Comput."},{"key":"1768_CR54","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.jocs.2012.01.002","volume":"3","author":"X-L Luo","year":"2012","unstructured":"Luo, X.-L.: A dynamical method of DAEs for the smallest eigenvalue problem. J. Comput. Sci. 3, 113\u2013119 (2012)","journal-title":"J. Comput. Sci."},{"key":"1768_CR55","doi-asserted-by":"crossref","unstructured":"Luo, X.-L., Lv, J.-H., Sun, G.: Continuation method with the trusty time-stepping scheme for linearly constrained optimization with noisy data, Optim. Eng. 23, 329\u2013360 (2022). http:\/\/doi.org\/10.1007\/s11081-020-09590-z","DOI":"10.1007\/s11081-020-09590-z"},{"key":"1768_CR56","doi-asserted-by":"crossref","unstructured":"Luo, X.-L., Xiao, H., Lv, J.-H.: Continuation Newton methods with the residual trust-region time-stepping scheme for nonlinear equations, Numer. Algorithms 89, 223\u2013247 (2022). http:\/\/doi.org\/10.1007\/s11075-021-01112-x","DOI":"10.1007\/s11075-021-01112-x"},{"key":"1768_CR57","doi-asserted-by":"crossref","unstructured":"Luo, X.-L., Yao, Y.Y.: Primal-dual path-following methods and the trust-region strategy for linear programming with noisy data, J. Comput. Math. 40, 760\u2013780 (2022). http:\/\/doi.org\/10.4208\/jcm.2101-m2020-0173","DOI":"10.4208\/jcm.2101-m2020-0173"},{"key":"1768_CR58","doi-asserted-by":"crossref","unstructured":"Luo, X.-L., Xiao, H., Lv, J.-H., Zhang, S.: Explicit pseudo-transient continuation and the trust-region updating strategy for unconstrained optimization. Appl. Numer. Math. 165, 290\u2013302 (2021). http:\/\/doi.org\/10.1016\/j.apnum.2021.02.019","DOI":"10.1016\/j.apnum.2021.02.019"},{"key":"1768_CR59","doi-asserted-by":"crossref","unstructured":"Luo, X.-L., Xiao, H.: Generalized continuation Newton methods and the trust-region updating strategy for the underdetermined system, J. Sci. comput. 88, article 56, 1\u201322 (2021). http:\/\/doi.org\/10.1007\/s10915-021-01566-0","DOI":"10.1007\/s10915-021-01566-0"},{"key":"1768_CR60","doi-asserted-by":"crossref","unstructured":"Luo, X.-L., Xiao, H.: The regularization continuation method with an adaptive time step control for linearly constrained optimization problems, Appl. Numer. Math. 181, 255\u2013276 (2022). https:\/\/doi.org\/10.1016\/j.apnum.2022.06.008","DOI":"10.1016\/j.apnum.2022.06.008"},{"key":"1768_CR61","unstructured":"Luo, X.-L., Zhang, S., Xiao, H.: Regularization path-following methods with the trust-region updating strategy for linear complementarity problems. arXiv preprint available at http:\/\/arxiv.org\/abs\/2205.10727, pp. 1-30, May 21, (2022)"},{"key":"1768_CR62","doi-asserted-by":"crossref","unstructured":"Luo, X.-L., Xiao, H., Zhang, S.: The regularization continuation method for optimization problems with nonlinear equality constraints. arXiv preprint available at http:\/\/arxiv.org\/abs\/2303.14692, pp. 1\u201341, March 28, (2023)","DOI":"10.1007\/s10915-024-02476-7"},{"key":"1768_CR63","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0577-0","volume-title":"Genetic algorithms: concepts and designs","author":"KF Man","year":"1999","unstructured":"Man, K.F., Tang, K.S., Kwong, S.: Genetic algorithms: concepts and designs. Springer, Berlin (1999)"},{"key":"1768_CR64","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1007\/s10898-020-00917-9","volume":"77","author":"MJFG Mac\u00eado","year":"2020","unstructured":"Mac\u00eado, M.J.F.G., Karas, E.W., Costa, M.F.P., Rocha, A.M.A.C.: Filter-based stochastic algorithm for global optimization. J. Glob. Optim. 77, 777\u2013805 (2020)","journal-title":"J. Glob. Optim."},{"key":"1768_CR65","unstructured":"MATLAB R2021b.: The MathWorks Inc., http:\/\/www.mathworks.com, (2021)"},{"key":"1768_CR66","unstructured":"MCS.: The multilevel coordinate search, available at https:\/\/www.mat.univie.ac.at\/~neum\/software\/mcs\/, (2000)"},{"key":"1768_CR67","doi-asserted-by":"crossref","unstructured":"Mitchell, M.: An introduction to genetic algorithms. MIT press, Cambridge, MA (1996)","DOI":"10.7551\/mitpress\/3927.001.0001"},{"key":"1768_CR68","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Soft. 7, 17\u201341 (1981)","journal-title":"ACM Trans. Math. Soft."},{"key":"1768_CR69","volume-title":"On evolution, search, optimization, gas and martial arts: toward memetic algorithms, Technical report, Caltech Concurrent Computation Program 158\u201379","author":"P Moscato","year":"1989","unstructured":"Moscato, P.: On evolution, search, optimization, gas and martial arts: toward memetic algorithms, Technical report, Caltech Concurrent Computation Program 158\u201379. California Institute of Technology, Pasadena, California (1989)"},{"key":"1768_CR70","unstructured":"Morgans, R.C., Howard, C.Q., Zander, A.C., Hansen, C.H., Murphy, D.J.: Derivative free optimisation in engineering and acoustics, 14th International Congress on Sound & Vibration, 1\u20138 (2007)"},{"key":"1768_CR71","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/080743627","volume":"52","author":"RD Neidinger","year":"2010","unstructured":"Neidinger, R.D.: Introduction to automatic differentiation and MATLAB object-oriented programming. SIAM Rev. 52, 545\u2013563 (2010). https:\/\/doi.org\/10.1137\/080743627","journal-title":"SIAM Rev."},{"key":"1768_CR72","unstructured":"Neumaier, A.: MCS: global optimization by multilevel coordinate search. (2000)https:\/\/www.mat.univie.ac.at\/~neum\/software\/mcs\/"},{"key":"1768_CR73","unstructured":"NEOS Server.: (2021). https:\/\/neos-server.org\/neos\/"},{"key":"1768_CR74","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical optimization. Springer-Verlag, Berlin (1999)"},{"key":"1768_CR75","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719468","volume-title":"Iteration solution of nonlinear equations in several variables","author":"JM Ortega","year":"2000","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iteration solution of nonlinear equations in several variables. SIAM, Philadelphia, PA (2000)"},{"key":"1768_CR76","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1007\/s10898-012-9940-1","volume":"56","author":"RG Regis","year":"2013","unstructured":"Regis, R.G., Shoemaker, C.A.: A quasi-multistart framework for global optimization of expensive functions using response surface models. J. Glob. Optim. 56, 1719\u20131753 (2013)","journal-title":"J. Glob. Optim."},{"key":"1768_CR77","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"Rios, L.M., Sahinidis, N.V.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Glob. Optim. 56, 1247\u20131293 (2013)","journal-title":"J. Glob. Optim."},{"key":"1768_CR78","doi-asserted-by":"crossref","unstructured":"Rosenbrock, H.H.: An automatic method for finding the greatest or least value of a function, Comput. J. 3, 175\u2013184 (1960). Aailable online at http:\/\/comjnl.oxfordjournals.org\/content\/3\/3\/175.full.pdf","DOI":"10.1093\/comjnl\/3.3.175"},{"key":"1768_CR79","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615542","volume-title":"Solving ODEs with MATLAB","author":"LF Shampine","year":"2003","unstructured":"Shampine, L.F., Gladwell, I., Thompson, S.: Solving ODEs with MATLAB. Cambridge University Press, Cambridge (2003)"},{"key":"1768_CR80","unstructured":"Sahinidis, N.\u00a0V.: BARON 21.1.13: Global optimization of mixed-integer nonlinear programs, user\u2019s manual (2021). Available at https:\/\/minlp.com\/downloads\/docs\/baron manual.pdf"},{"key":"1768_CR81","unstructured":"Surjanovic, S., Bingham, D.: Virtual library of simulation experiments: test functions and datasets, available at http:\/\/www.sfu.ca\/~ssurjano, January (2020)"},{"key":"1768_CR82","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1162\/EVCO_a_00068","volume":"21","author":"J Sun","year":"2014","unstructured":"Sun, J., Garibaldi, J.M., Krasnogor, N., Zhang, Q.: An intelligent muti-restart memetic algorithm for box constrained global optimisation. Evol. Comput. 21, 107\u2013147 (2014)","journal-title":"Evol. Comput."},{"key":"1768_CR83","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-017-18940-4","volume":"8","author":"YD Sergeyev","year":"2018","unstructured":"Sergeyev, Y.D., Kvasov, D.E., Mukhametzhanov, M.S.: On the efficiency of nature-inspired metaheuristics in expensive global optimization with limited budget. Sci. Rep. 8, 1\u20139 (2018)","journal-title":"Sci. Rep."},{"key":"1768_CR84","doi-asserted-by":"crossref","unstructured":"Sergeyev, Y.D., Kvasov, D.E.: Deterministic global optimization: an introduction to the diagonal approach, Springer, (2017)","DOI":"10.1007\/978-1-4939-7199-2"},{"key":"1768_CR85","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.matcom.2016.05.006","volume":"141","author":"YD Sergeyev","year":"2017","unstructured":"Sergeyev, Y.D., Kvasov, D.E., Mukhametzhanov, M.S.: Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms. Math. Comput. Simul. 141, 96\u2013109 (2017)","journal-title":"Math. Comput. Simul."},{"key":"1768_CR86","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.cnsns.2014.08.026","volume":"21","author":"YD Sergeyev","year":"2015","unstructured":"Sergeyev, Y.D., Kvasov, D.E.: A deterministic global optimization using smooth diagonal auxiliary functions. Commun. Nonlinear Sci. 21, 99\u2013111 (2015)","journal-title":"Commun. Nonlinear Sci."},{"key":"1768_CR87","volume-title":"Optimization theory and methods: nonlinear programming","author":"W-Y Sun","year":"2006","unstructured":"Sun, W.-Y., Yuan, Y.-X.: Optimization theory and methods: nonlinear programming. Springer, Berlin (2006)"},{"key":"1768_CR88","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/0362-546X(79)90064-6","volume":"3","author":"K Tanabe","year":"1979","unstructured":"Tanabe, K.: Continuous Newton-Raphson method for solving an underdetermined system of nonlinear equations. Nonlinear Anal. 3, 495\u2013503 (1979)","journal-title":"Nonlinear Anal."},{"key":"1768_CR89","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"1768_CR90","doi-asserted-by":"crossref","unstructured":"Teughels, A., Roeck, G.. De., Suykens, J.A.K.: Global optimization by coupled local minimizers and its application to FE model updating. Comput. Sturct. 81, 2337\u20132351 (2003)","DOI":"10.1016\/S0045-7949(03)00313-4"},{"key":"1768_CR91","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1287\/ijoc.1060.0175","volume":"19","author":"Z Ugray","year":"2007","unstructured":"Ugray, Z., Lasdon, L., Plummer, J., Glover, F., Kelly, J., Marti, R.: Scatter search and local NLP solvers: a multistart framework for global optimization. INFORMS J. Comput. 19, 328\u2013340 (2007)","journal-title":"INFORMS J. Comput."},{"key":"1768_CR92","unstructured":"Willkomm, J., Vehreschild, A.: The ADiMat handbook, (2013). http:\/\/adimat.sc.informatik.tu-darmstadt.de\/doc\/"},{"key":"1768_CR93","first-page":"408","volume":"9","author":"J Willkomm","year":"2014","unstructured":"Willkomm, J., Bischof, C.H., B\u00fccker, H.M.: A new user interface for ADiMat: toward accurate and efficient derivatives of MATLAB programmes with ease of use. Int. J. Comput. Sci. Eng. 9, 408\u2013415 (2014)","journal-title":"Int. J. Comput. Sci. Eng."},{"key":"1768_CR94","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1016\/j.apacoust.2004.06.003","volume":"65","author":"J Xu","year":"2004","unstructured":"Xu, J., Nannariello, J., Fricke, F.R.: Optimising flat-walled multi-layered anechoic linings using evolutionary algorithms. Appl. Acoust. 65, 1009\u20131026 (2004)","journal-title":"Appl. Acoust."},{"key":"1768_CR95","unstructured":"Yuan, Y.-X.: Trust region algorithms for nonlinear equations. Information 1, 7\u201320 (1998)"},{"key":"1768_CR96","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10107-015-0893-2","volume":"151","author":"Y-X Yuan","year":"2015","unstructured":"Yuan, Y.-X.: Recent advances in trust region algorithms. Math. Program. 151, 249\u2013281 (2015)","journal-title":"Math. Program."},{"key":"1768_CR97","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s10898-019-00814-w","volume":"79","author":"A \u017dilinskas","year":"2021","unstructured":"\u017dilinskas, A., Gillard, J., Scammell, M., Zhiglijavsky, A.: Multistart with early termination of descents. J. Glob. Optim. 79, 447\u2013462 (2021)","journal-title":"J. Glob. Optim."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01768-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01768-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01768-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T04:25:27Z","timestamp":1732767927000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01768-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,22]]},"references-count":97,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1768"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01768-1","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2427025\/v1","asserted-by":"object"}]},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,22]]},"assertion":[{"value":"30 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}