{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T14:58:03Z","timestamp":1778511483703,"version":"3.51.4"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T00:00:00Z","timestamp":1736208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T00:00:00Z","timestamp":1736208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100006192","name":"Advanced Scientific Computing Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006192","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10589-024-00641-0","type":"journal-article","created":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T09:59:32Z","timestamp":1736243972000},"page":"481-513","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Convergence analysis for a nonlocal gradient descent method via directional Gaussian smoothing"],"prefix":"10.1007","volume":"90","author":[{"given":"Hoang","family":"Tran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7256-150X","authenticated-orcid":false,"given":"Guannan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,7]]},"reference":[{"key":"641_CR1","volume-title":"Handbook of Mathematical Functions","year":"1972","unstructured":"Abramowitz, M., Stegun, I. (eds.): Handbook of Mathematical Functions. Dover, New York (1972)"},{"key":"641_CR2","volume-title":"Mathematical methods for physicists: a comprehensive guide","author":"GB Arfken","year":"2013","unstructured":"Arfken, G.B., Weber, H.J., Harris, F.E.: Mathematical methods for physicists: a comprehensive guide, 7th edn. Academic Press, Amsterdam (2013)","edition":"7"},{"issue":"3","key":"641_CR3","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1137\/130915984","volume":"24","author":"AS Bandeira","year":"2014","unstructured":"Bandeira, A.S., Scheinberg, K., Vicente, L.N.: Convergence of trust-region methods based on probabilistic models. SIAM J. Optim. 24(3), 1238\u20131264 (2014). https:\/\/doi.org\/10.1137\/130915984","journal-title":"SIAM J. Optim."},{"issue":"4","key":"641_CR4","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1093\/comjnl\/3.4.272","volume":"3","author":"W Barrett","year":"1961","unstructured":"Barrett, W.: Convergence properties of Gaussian quadrature formulae. Comput. J. 3(4), 272\u2013277 (1961). https:\/\/doi.org\/10.1093\/comjnl\/3.4.272","journal-title":"Comput. J."},{"issue":"2","key":"641_CR5","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1137\/18M1177718","volume":"29","author":"AS Berahas","year":"2019","unstructured":"Berahas, A.S., Byrd, R.H., Nocedal, J.: Derivative-free optimization of noisy functions via quasi-newton methods. SIAM J. Optim. 29(2), 965\u2013993 (2019). https:\/\/doi.org\/10.1137\/18M1177718","journal-title":"SIAM J. Optim."},{"key":"641_CR6","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10208-021-09513-z","volume":"22","author":"AS Berahas","year":"2022","unstructured":"Berahas, A.S., Cao, L., et al.: A theoretical and empirical comparison of gradient approximations in derivative-free optimization. Found. Comput. Math. 22, 507\u2013560 (2022). https:\/\/doi.org\/10.1007\/s10208-021-09513-z","journal-title":"Found. Comput. Math."},{"issue":"4","key":"641_CR7","doi-asserted-by":"publisher","first-page":"3312","DOI":"10.1137\/17M1154679","volume":"28","author":"R Bollapragada","year":"2018","unstructured":"Bollapragada, R., Byrd, R., Nocedal, J.: Adaptive sampling strategies for stochastic optimization. SIAM J. Optim. 28(4), 3312\u20133343 (2018). https:\/\/doi.org\/10.1137\/17M1154679","journal-title":"SIAM J. Optim."},{"key":"641_CR8","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-017-1137-4","volume":"169","author":"C Cartis","year":"2018","unstructured":"Cartis, C., Scheinberg, K.: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math. Program. 169, 337\u2013375 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1137-4","journal-title":"Math. Program."},{"issue":"2","key":"641_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10107-017-1141-8","volume":"169","author":"R Chen","year":"2018","unstructured":"Chen, R., Menickelly, M., Scheinberg, K.: Stochastic optimization using a trust-region method and random models. Math. Program. 169(2), 447\u2013487 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1141-8","journal-title":"Math. Program."},{"issue":"4","key":"641_CR10","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/S1052623499354096","volume":"10","author":"TD Choi","year":"2000","unstructured":"Choi, T.D., Kelley, C.T.: Superlinear convergence and implicit filtering. SIAM J. Optim. 10(4), 1149\u20131162 (2000). https:\/\/doi.org\/10.1137\/S1052623499354096","journal-title":"SIAM J. Optim."},{"key":"641_CR11","unstructured":"Choromanski, K., Rowland, M., et\u00a0al.: Structured evolution with compact architectures for scalable policy optimization. In: International Conference on Machine Learning, pp.\u00a0969\u2013977, (2018)"},{"key":"641_CR12","doi-asserted-by":"publisher","unstructured":"Choromanski, K.M., Pacchiano, A., et\u00a0al.: From complexity to simplicity: Adaptive es-active subspaces for blackbox optimization. In: Advances in Neural Information Processing Systems 32, pp.\u00a010299\u201310309. Curran Associates, Inc., (2019). https:\/\/doi.org\/10.5555\/3454287.3455211","DOI":"10.5555\/3454287.3455211"},{"issue":"5","key":"641_CR13","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MSP.2020.3003539","volume":"37","author":"FE Curtis","year":"2020","unstructured":"Curtis, F.E., Scheinberg, K.: Adaptive stochastic optimization: a framework for analyzing stochastic optimization algorithms. IEEE Signal Process. Mag. 37(5), 32\u201342 (2020). https:\/\/doi.org\/10.1109\/MSP.2020.3003539","journal-title":"IEEE Signal Process. Mag."},{"key":"641_CR14","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-319-99259-4_24","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV: 15th International Conference, Coimbra, Portugal, September 8\u201312, 2018, Proceedings, Part II","author":"SJ Daniels","year":"2018","unstructured":"Daniels, S.J., Rahat, A.A.M., Everson, R.M., Tabor, G.R., Fieldsend, J.E.: A Suite of Computationally Expensive Shape Optimisation Problems Using Computational Fluid Dynamics. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) Parallel Problem Solving from Nature \u2013 PPSN XV: 15th International Conference, Coimbra, Portugal, September 8\u201312, 2018, Proceedings, Part II, pp. 296\u2013307. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99259-4_24"},{"issue":"2","key":"641_CR15","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1137\/16M1087461","volume":"56","author":"J Dick","year":"2018","unstructured":"Dick, J., Irrgeher, C., et al.: On the optimal order of integration in Hermite spaces with finite smoothness. SIAM J. Numer. Anal. 56(2), 684\u2013707 (2018). https:\/\/doi.org\/10.1137\/16M1087461","journal-title":"SIAM J. Numer. Anal."},{"key":"641_CR16","doi-asserted-by":"crossref","unstructured":"Du, Q.: Nonlocal Modeling, Analysis, and Computation. SIAM, (2019)","DOI":"10.1137\/1.9781611975628"},{"issue":"03","key":"641_CR17","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1142\/S0218202512500546","volume":"23","author":"Q Du","year":"2013","unstructured":"Du, Q., Gunzburger, M., et al.: A nonlocal vector calculus, nonlocal volume-constrained problems, and nonlocal balance laws. Math. Models Methods Appl. Sci. 23(03), 493\u2013540 (2013). https:\/\/doi.org\/10.1142\/S0218202512500546","journal-title":"Math. Models Methods Appl. Sci."},{"issue":"5","key":"641_CR18","doi-asserted-by":"publisher","first-page":"2788","DOI":"10.1109\/TIT.2015.2409256","volume":"61","author":"JC Duchi","year":"2015","unstructured":"Duchi, J.C., Jordan, M.I., et al.: Optimal rates for zero-order convex optimization: the power of two function evaluations. IEEE Trans. Inf. Theory 61(5), 2788\u20132806 (2015). https:\/\/doi.org\/10.1109\/TIT.2015.2409256","journal-title":"IEEE Trans. Inf. Theory"},{"key":"641_CR19","doi-asserted-by":"publisher","unstructured":"Flaxman, A.D., Kalai, A.T., McMahan, H.B.: Online convex optimization in the bandit setting: gradient descent without a gradient. In: Proceedings of the 16th Annual ACM-SIAM symposium on Discrete Algorithms, pp.\u00a0385\u2013394, (2005). https:\/\/doi.org\/10.48550\/arXiv.cs\/0408007","DOI":"10.48550\/arXiv.cs\/0408007"},{"issue":"3","key":"641_CR20","doi-asserted-by":"publisher","first-page":"A1380","DOI":"10.1137\/110830629","volume":"34","author":"MP Friedlander","year":"2012","unstructured":"Friedlander, M.P., Schmidt, M.: Hybrid deterministic-stochastic methods for data fitting. SIAM J. Sci. Comput. 34(3), A1380\u2013A1405 (2012). https:\/\/doi.org\/10.1137\/110830629","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"641_CR21","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first- and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013). https:\/\/doi.org\/10.1137\/120880811","journal-title":"SIAM J. Optim."},{"issue":"2","key":"641_CR22","first-page":"5","volume":"9","author":"A Hoorfar","year":"2008","unstructured":"Hoorfar, A., Hassani, M.: Inequalities on the lambert w function and hyperpower function. J. Inequal. Pure Appl. Math 9(2), 5\u20139 (2008)","journal-title":"J. Inequal. Pure Appl. Math"},{"key":"641_CR23","doi-asserted-by":"publisher","unstructured":"Houthooft, R., Chen, Y., et\u00a0al.: Evolved policy gradients. In: Advances in Neural Information Processing Systems, pp.\u00a05400\u20135409, (2018). https:\/\/doi.org\/10.5555\/3327345.3327445","DOI":"10.5555\/3327345.3327445"},{"key":"641_CR24","doi-asserted-by":"publisher","unstructured":"Irwin, B.: How to descend a rocky slope: numerical techniques for the solution of noisy optimization problems. In: Ph.D. thesis, University of British Columbia, (2023). https:\/\/doi.org\/10.14288\/1.0436950","DOI":"10.14288\/1.0436950"},{"key":"641_CR25","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/s10589-022-00448-x","volume":"84","author":"B Irwin","year":"2023","unstructured":"Irwin, B., Haber, E.: Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition. Comput. Optim. Appl. 84, 651\u2013702 (2023). https:\/\/doi.org\/10.1007\/s10589-022-00448-x","journal-title":"Comput. Optim. Appl."},{"key":"641_CR26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971903","author":"CT Kelley","year":"2011","unstructured":"Kelley, C.T.: Implicit filtering. Soc. Ind. Appl. Math. (2011). https:\/\/doi.org\/10.1137\/1.9781611971903","journal-title":"Soc. Ind. Appl. Math."},{"key":"641_CR27","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0962492919000060","volume":"28","author":"J Larson","year":"2019","unstructured":"Larson, J., Menickelly, M., Wild, S.M.: Derivative-free optimization methods. Acta Numer 28, 287\u2013404 (2019). https:\/\/doi.org\/10.1017\/S0962492919000060","journal-title":"Acta Numer"},{"issue":"4","key":"641_CR28","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/0021-9045(83)90078-3","volume":"39","author":"D Lubinsky","year":"1983","unstructured":"Lubinsky, D.: Geometric convergence of lagrangian interpolation and numerical integration rules over unbounded contours and intervals. J. Approx. Theory 39(4), 338\u2013360 (1983). https:\/\/doi.org\/10.1016\/0021-9045(83)90078-3","journal-title":"J. Approx. Theory"},{"issue":"2","key":"641_CR29","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1137\/15M1031679","volume":"28","author":"A Maggiar","year":"2018","unstructured":"Maggiar, A., Wachter, A., et al.: A derivative-free trust-region algorithm for the optimization of functions smoothed via gaussian convolution using adaptive multiple importance sampling. SIAM J. Optim. 28(2), 1478\u20131507 (2018). https:\/\/doi.org\/10.1137\/15M1031679","journal-title":"SIAM J. Optim."},{"key":"641_CR30","unstructured":"Maheswaranathan, N., Metz, L., et\u00a0al.: Guided evolutionary strategies: Augmenting random search with surrogate gradients. In: Proceedings of the 36th International Conference on Machine Learning, (2019). https:\/\/proceedings.mlr.press\/v97\/maheswaranathan19a\/maheswaranathan19a.pdf"},{"key":"641_CR31","unstructured":"Mania, H., Guy, A., Recht, B.: Simple random search of static linear policies is competitive for reinforcement learning. In: NeurIPS, (2018). https:\/\/dl.acm.org\/doi\/10.5555\/3326943.3327109"},{"key":"641_CR32","doi-asserted-by":"crossref","unstructured":"Mastroianni, G., Monegato, G.: Error estimates for gauss-laguerre and gauss-hermite quadrature formulas. In: Approximation and Computation: A Festschrift in Honor of Walter Gautschi: Proceedings of the Purdue Conference, December 2\u20135, 1993, pp.\u00a0421\u2013434. Springer, (1994)","DOI":"10.1007\/978-1-4684-7415-2_28"},{"key":"641_CR33","doi-asserted-by":"publisher","unstructured":"Meier, F., Mujika, A., et\u00a0al.: Improving gradient estimation in evolutionary strategies with past descent directions. In: Optimization Foundations for Reinforcement Learning Workshop at NeurIPS 2019, (2019). https:\/\/doi.org\/10.48550\/arXiv.1910.05268","DOI":"10.48550\/arXiv.1910.05268"},{"issue":"11","key":"641_CR34","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1038\/s41566-018-0246-9","volume":"12","author":"S Molesky","year":"2018","unstructured":"Molesky, S., Lin, Z., et al.: Inverse design in nanophotonics. Nat. Photonics 12(11), 659\u2013670 (2018). https:\/\/doi.org\/10.1038\/s41566-018-0246-9","journal-title":"Nat. Photonics"},{"key":"641_CR35","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.1137\/100786125","volume":"33","author":"JJ Mor\u00e9","year":"2011","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Estimating computational noise. SIAM J. Sci. Comput. 33, 1292\u20131314 (2011). https:\/\/doi.org\/10.1137\/100786125","journal-title":"SIAM J. Sci. Comput."},{"key":"641_CR36","doi-asserted-by":"publisher","DOI":"10.1145\/2168773.2168777","author":"JJ Mor\u00e9","year":"2012","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Estimating derivatives of noisy simulations. ACM Trans. Math. Softw. (2012). https:\/\/doi.org\/10.1145\/2168773.2168777","journal-title":"ACM Trans. Math. Softw."},{"key":"641_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Springer, US (2004)"},{"issue":"2","key":"641_CR38","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","volume":"17","author":"Y Nesterov","year":"2017","unstructured":"Nesterov, Y., Spokoiny, V.: Random gradient-free minimization of convex functions. Found. Comput. Math. 17(2), 527\u2013566 (2017). https:\/\/doi.org\/10.1007\/s10208-015-9296-2","journal-title":"Found. Comput. Math."},{"key":"641_CR39","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.nimb.2022.06.001","volume":"525","author":"MI Radaideh","year":"2022","unstructured":"Radaideh, M.I., Tran, H., et al.: Model calibration of the liquid mercury spallation target using evolutionary neural networks and sparse polynomial expansions. Nucl. Instrum. Methods Phys. Res., Sect. B 525, 41\u201354 (2022). https:\/\/doi.org\/10.1016\/j.nimb.2022.06.001","journal-title":"Nucl. Instrum. Methods Phys. Res., Sect. B"},{"key":"641_CR40","unstructured":"Real, E., Moore, S., et\u00a0al.: Large-scale evolution of image classifiers. In: International Conference on Machine Learning (ICML), pp.\u00a02902\u20132911, (2017)"},{"key":"641_CR41","unstructured":"Salimans, T., Ho, J., et\u00a0al.: Evolution strategies as a scalable alternative to reinforcement learning. arXiv preprint[SPACE]arXiv:1703.03864, (2017)"},{"key":"641_CR42","unstructured":"Sener, O., Koltun, V.: Learning to guide random search. In: International Conference on Learning Representations, (2020). https:\/\/openreview.net\/forum?id=B1gHokBKwS"},{"issue":"1","key":"641_CR43","first-page":"1703","volume":"18","author":"O Shamir","year":"2017","unstructured":"Shamir, O.: An optimal algorithm for bandit and zero-order convex optimization with two-point feedback. J. Mach. Learn. Res. 18(1), 1703\u20131713 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"641_CR44","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1137\/20M1373190","volume":"32","author":"HJM Shi","year":"2022","unstructured":"Shi, H.J.M., Xie, Y., et al.: A noise-tolerant quasi-newton algorithm for unconstrained optimization. SIAM J. Optim. 32(1), 29\u201355 (2022). https:\/\/doi.org\/10.1137\/20M1373190","journal-title":"SIAM J. Optim."},{"key":"641_CR45","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2022.2121832","author":"HJM Shi","year":"2022","unstructured":"Shi, H.J.M., Xuan, M.Q., et al.: On the numerical performance of finite-difference-based methods for derivative-free optimization. Optimiz. Methods Softw. (2022). https:\/\/doi.org\/10.1080\/10556788.2022.2121832","journal-title":"Optimiz. Methods Softw."},{"issue":"162","key":"641_CR46","first-page":"519","volume":"40","author":"WE Smith","year":"1983","unstructured":"Smith, W.E., Sloan, I.H., Opie, A.H.: Product integration over infinite intervals i. rules based on the zeros of Hermite polynomials. Math. Comput. 40(162), 519\u2013535 (1983)","journal-title":"Math. Comput."},{"key":"641_CR47","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10107-023-01941-9","volume":"202","author":"S Sun","year":"2023","unstructured":"Sun, S., Nocedal, J.: A trust region method for noisy unconstrained optimization. Math. Program. 202, 445\u2013472 (2023). https:\/\/doi.org\/10.1007\/s10107-023-01941-9","journal-title":"Math. Program."},{"key":"641_CR48","doi-asserted-by":"publisher","unstructured":"Tran, H., Zhang, G.: AdaDGS: An adaptive black-box optimization method with a nonlocal directional gaussian smoothing gradient. arXiv:2011.02009v1, (2020). https:\/\/doi.org\/10.48550\/arXiv.2011.02009","DOI":"10.48550\/arXiv.2011.02009"},{"issue":"1","key":"641_CR49","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/20M1389522","volume":"64","author":"LN Trefethen","year":"2022","unstructured":"Trefethen, L.N.: Exactness of quadrature formulas. SIAM Rev. 64(1), 132\u2013150 (2022). https:\/\/doi.org\/10.1137\/20M1389522","journal-title":"SIAM Rev."},{"issue":"3","key":"641_CR50","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1090\/S0002-9947-1928-1501444-8","volume":"30","author":"JV Uspensky","year":"1928","unstructured":"Uspensky, J.V.: On the convergence of quadrature formulas related to an infinite interval. Trans. Am. Math. Soc. 30(3), 542\u2013559 (1928)","journal-title":"Trans. Am. Math. Soc."},{"key":"641_CR51","doi-asserted-by":"publisher","unstructured":"Volz, V., Schrum, J., et\u00a0al.: Evolving mario levels in the latent space of a deep convolutional generative adversarial network. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201918, p.\u00a0221-228, New York, NY, USA, (2018). Association for Computing Machinery. https:\/\/doi.org\/10.1145\/3205455.3205517","DOI":"10.1145\/3205455.3205517"},{"key":"641_CR52","doi-asserted-by":"crossref","unstructured":"Wang, H., Zhang, L.: Convergence analysis of Hermite approximations for analytic functions. arXiv preprintarXiv:2312.07940, (2023)","DOI":"10.1090\/mcom\/3942"},{"issue":"1","key":"641_CR53","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/19M1240794","volume":"30","author":"Y Xie","year":"2020","unstructured":"Xie, Y., Byrd, R.H., Nocedal, J.: Analysis of the BFGS Method with Errors. SIAM J. Optim. 30(1), 182\u2013209 (2020). https:\/\/doi.org\/10.1137\/19M1240794","journal-title":"SIAM J. Optim."},{"key":"641_CR54","unstructured":"Zhang, J., Tran, H., et\u00a0al.: Enabling long-range exploration in minimization of multimodal functions. In: Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, UAI 2021, Virtual Event, 27-30 July 2021, C.P.\u00a0de\u00a0Campos, M.H.\u00a0Maathuis, E.\u00a0Quaeghebeur, eds., vol. 161 of Proceedings of Machine Learning Research, pp.\u00a01639\u20131649. AUAI Press, (2021). https:\/\/proceedings.mlr.press\/v161\/zhang21e.html"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00641-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00641-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00641-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T11:37:10Z","timestamp":1740742630000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00641-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,7]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["641"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00641-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,7]]},"assertion":[{"value":"19 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}