{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T18:10:21Z","timestamp":1773771021530,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T00:00:00Z","timestamp":1715040000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T00:00:00Z","timestamp":1715040000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000015","name":"US Department of Energy","doi-asserted-by":"crossref","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s11590-024-02114-z","type":"journal-article","created":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T10:02:01Z","timestamp":1715076121000},"page":"1335-1360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multistart algorithm for identifying all optima of nonconvex stochastic functions"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7637-2754","authenticated-orcid":false,"given":"Prateek","family":"Jaiswal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Larson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,7]]},"reference":[{"issue":"9","key":"2114_CR1","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1016\/j.jct.2011.03.021","volume":"43","author":"AE Gheribi","year":"2011","unstructured":"Gheribi, A.E., Robelin, C., Digabel, S.L., Audet, C., Pelton, A.D.: Calculating all local minima on liquidus surfaces using the FactSage software and databases and the mesh adaptive direct search algorithm. J. Chem. Thermodyn. 43(9), 1323\u20131330 (2011). https:\/\/doi.org\/10.1016\/j.jct.2011.03.021","journal-title":"J. Chem. Thermodyn."},{"issue":"28","key":"2114_CR2","doi-asserted-by":"publisher","first-page":"8370","DOI":"10.1002\/anie.201713416","volume":"57","author":"J Adamcik","year":"2018","unstructured":"Adamcik, J., Mezzenga, R.: Amyloid polymorphism in the protein folding and aggregation energy landscape. Angewandte Ch\u00e9mie Int. Edit. 57(28), 8370\u20138382 (2018). https:\/\/doi.org\/10.1002\/anie.201713416","journal-title":"Angewandte Ch\u00e9mie Int. Edit."},{"key":"2114_CR3","doi-asserted-by":"publisher","unstructured":"Floudas, C., Klepeis, J., Pardalos, P.: Global optimization approaches in protein folding and peptide docking. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 47, pp. 141\u2013171. Am. Math. Soc. (1999). https:\/\/doi.org\/10.1090\/dimacs\/047\/07","DOI":"10.1090\/dimacs\/047\/07"},{"issue":"19","key":"2114_CR4","doi-asserted-by":"publisher","first-page":"6611","DOI":"10.1073\/pnas.84.19.6611","volume":"84","author":"Z Li","year":"1987","unstructured":"Li, Z., Scheraga, H.A.: Monte Carlo-minimization approach to the multiple-minima problem in protein folding. Proc. Natl. Acad. Sci. U.S.A. 84(19), 6611\u20136615 (1987). https:\/\/doi.org\/10.1073\/pnas.84.19.6611","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"1","key":"2114_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10898-010-9525-9","volume":"48","author":"D di Serafino","year":"2010","unstructured":"di Serafino, D., Gomez, S., Milano, L., Riccio, F., Toraldo, G.: A genetic algorithm for a global optimization problem arising in the detection of gravitational waves. J. Global Optim. 48(1), 41\u201355 (2010). https:\/\/doi.org\/10.1007\/s10898-010-9525-9","journal-title":"J. Global Optim."},{"key":"2114_CR6","doi-asserted-by":"publisher","first-page":"03060","DOI":"10.1051\/epjconf\/202125103060","volume":"251","author":"M Krishnamoorthy","year":"2021","unstructured":"Krishnamoorthy, M., Schulz, H., Ju, X., Wang, W., Leyffer, S., Marshall, Z., Mrenna, S., M\u00fcller, J., Kowalkowski, J.B.: Apprentice for event generator tuning. EPJ Web of Conf. 251, 03060 (2021). https:\/\/doi.org\/10.1051\/epjconf\/202125103060","journal-title":"EPJ Web of Conf."},{"issue":"1","key":"2114_CR7","first-page":"6765","volume":"18","author":"L Li","year":"2017","unstructured":"Li, L., Jamieson, K., DeSalvo, G., Rostamizadeh, A., Talwalkar, A.: Hyperband: a novel bandit-based approach to hyperparameter optimization. J. Mach. Learn. Res. 18(1), 6765\u20136816 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"2114_CR8","unstructured":"Maclaurin, D., Duvenaud, D., Adams, R.: Gradient-based hyperparameter optimization through reversible learning. In: International Conference on Machine Learning, pp. 2113\u20132122 (2015)"},{"key":"2114_CR9","doi-asserted-by":"publisher","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv:1411.4028 (2014). https:\/\/doi.org\/10.48550\/arXiv.1411.4028","DOI":"10.48550\/arXiv.1411.4028"},{"key":"2114_CR10","doi-asserted-by":"publisher","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem. arXiv:1412.6062 (2014). https:\/\/doi.org\/10.48550\/arXiv.1412.6062","DOI":"10.48550\/arXiv.1412.6062"},{"issue":"1","key":"2114_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/bf02592070","volume":"39","author":"AHG Rinnooy Kan","year":"1987","unstructured":"Rinnooy Kan, A.H.G., Timmer, G.T.: Stochastic global optimization methods part I Clustering methods. Math. Program. 39(1), 27\u201356 (1987). https:\/\/doi.org\/10.1007\/bf02592070","journal-title":"Math. Program."},{"issue":"1","key":"2114_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/bf02592071","volume":"39","author":"AHG Rinnooy Kan","year":"1987","unstructured":"Rinnooy Kan, A.H.G., Timmer, G.T.: Stochastic global optimization methods part II: Multi level methods. Math. Program. 39(1), 57\u201378 (1987). https:\/\/doi.org\/10.1007\/bf02592071","journal-title":"Math. Program."},{"issue":"4","key":"2114_CR13","doi-asserted-by":"publisher","first-page":"3145","DOI":"10.1137\/15m1042425","volume":"28","author":"S Shashaani","year":"2018","unstructured":"Shashaani, S., Hashemi, F.S., Pasupathy, R.: ASTRO-DF: A class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization. SIAM J. Optim. 28(4), 3145\u20133176 (2018). https:\/\/doi.org\/10.1137\/15m1042425","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2114_CR14","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s12532-017-0131-4","volume":"10","author":"J Larson","year":"2018","unstructured":"Larson, J., Wild, S.M.: Asynchronously parallel optimization solver for finding multiple minima. Math. Program. Comput. 10(3), 303\u2013332 (2018). https:\/\/doi.org\/10.1007\/s12532-017-0131-4","journal-title":"Math. Program. Comput."},{"issue":"1","key":"2114_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1115\/1.3653121","volume":"86","author":"HJ Kushner","year":"1964","unstructured":"Kushner, H.J.: A new method of locating the maximum point of an arbitrary multipeak curve in the presence of noise. J. Basic Eng. 86(1), 97 (1964). https:\/\/doi.org\/10.1115\/1.3653121","journal-title":"J. Basic Eng."},{"key":"2114_CR16","doi-asserted-by":"publisher","unstructured":"Frazier, P.I.: Bayesian optimization. In: Recent Advances in Optimization and Modeling of Contemporary Problems, pp. 255\u2013278. INFORMS TutORials in Operations Research, (2018). https:\/\/doi.org\/10.1287\/educ.2018.0188","DOI":"10.1287\/educ.2018.0188"},{"issue":"1","key":"2114_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10898-020-00937-5","volume":"79","author":"L Mathesen","year":"2020","unstructured":"Mathesen, L., Pedrielli, G., Ng, S.H., Zabinsky, Z.B.: Stochastic optimization with adaptive restart: A framework for integrated local and global learning. J. Global Optim. 79(1), 87\u2013110 (2020). https:\/\/doi.org\/10.1007\/s10898-020-00937-5","journal-title":"J. Global Optim."},{"issue":"1","key":"2114_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/a:1008246031222","volume":"13","author":"M Locatelli","year":"1998","unstructured":"Locatelli, M.: Relaxing the assumptions of the multilevel single linkage algorithm. J. Global Optim. 13(1), 25\u201342 (1998). https:\/\/doi.org\/10.1023\/a:1008246031222","journal-title":"J. Global Optim."},{"key":"2114_CR19","doi-asserted-by":"publisher","unstructured":"Nguyen, V., Rana, S., Gupta, S., Li, C., Venkatesh, S.: Budgeted batch Bayesian optimization with unknown batch sizes. arXiv:1703.04842 (2017). https:\/\/doi.org\/10.48550\/arXiv.1703.04842","DOI":"10.48550\/arXiv.1703.04842"},{"key":"2114_CR20","doi-asserted-by":"publisher","unstructured":"Wessing, S., Preuss, M.: The true destination of EGO is multi-local optimization. In: IEEE Latin American Conference on Computational Intelligence (2017). https:\/\/doi.org\/10.1109\/la-cci.2017.8285677","DOI":"10.1109\/la-cci.2017.8285677"},{"issue":"5","key":"2114_CR21","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1111\/itor.12190","volume":"24","author":"T Krityakierne","year":"2015","unstructured":"Krityakierne, T., Shoemaker, C.A.: SOMS: SurrOgate MultiStart algorithm for use with nonlinear programming for global optimization. Int. Trans. Oper. Res. 24(5), 1139\u20131172 (2015). https:\/\/doi.org\/10.1111\/itor.12190","journal-title":"Int. Trans. Oper. Res."},{"key":"2114_CR22","doi-asserted-by":"publisher","unstructured":"Peri, D., Tinti, F.: A multistart gradient-based algorithm with surrogate model for global optimization. Commun. Appl. Ind. Math. 3(1) (2012). https:\/\/doi.org\/10.1685\/journal.caim.393","DOI":"10.1685\/journal.caim.393"},{"issue":"4","key":"2114_CR23","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1007\/s10898-012-9940-1","volume":"56","author":"RG Regis","year":"2012","unstructured":"Regis, R.G., Shoemaker, C.A.: A quasi-multistart framework for global optimization of expensive functions using response surface models. J. Global Optim. 56(4), 1719\u20131753 (2012). https:\/\/doi.org\/10.1007\/s10898-012-9940-1","journal-title":"J. Global Optim."},{"issue":"2","key":"2114_CR24","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10898-019-00814-w","volume":"79","author":"A \u017dilinskas","year":"2019","unstructured":"\u017dilinskas, A., Gillard, J., Scammell, M., Zhigljavsky, A.: Multistart with early termination of descents. J. Global Optim. 79(2), 447\u2013462 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00814-w","journal-title":"J. Global Optim."},{"key":"2114_CR25","doi-asserted-by":"publisher","unstructured":"Zheng, R., Li, M.: Multistart global optimization with tunnelling and an evolutionary strategy supervised by a martingale. Eng. Optim., 1\u201319 (2021). https:\/\/doi.org\/10.1080\/0305215x.2021.1940989","DOI":"10.1080\/0305215x.2021.1940989"},{"key":"2114_CR26","unstructured":"Jin, C., Liu, L.T., Ge, R., Jordan, M.I.: On the local minima of the empirical risk. In: Advances in Neural Information Processing Systems, pp. 4896\u20134905 (2018)"},{"issue":"1\u20132","key":"2114_CR27","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10107-014-0846-1","volume":"155","author":"S Ghadimi","year":"2014","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Math. Program. 155(1\u20132), 267\u2013305 (2014). https:\/\/doi.org\/10.1007\/s10107-014-0846-1","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2114_CR28","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2015","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156(1\u20132), 59\u201399 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0871-8","journal-title":"Math. Program."},{"issue":"1","key":"2114_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.4310\/amsa.2019.v4.n1.a1","volume":"4","author":"W Hu","year":"2019","unstructured":"Hu, W., Li, C.J., Li, L., Liu, J.-G.: On the diffusion approximation of nonconvex stochastic gradient descent. Ann. Math. Sci. Appl. 4(1), 3\u201332 (2019). https:\/\/doi.org\/10.4310\/amsa.2019.v4.n1.a1","journal-title":"Ann. Math. Sci. Appl."},{"key":"2114_CR30","doi-asserted-by":"publisher","unstructured":"Durrett, R.: Probability: Theory and Examples. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, (2010). https:\/\/doi.org\/10.1017\/CBO9780511779398","DOI":"10.1017\/CBO9780511779398"},{"issue":"2","key":"2114_CR31","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/opre.6.2.244","volume":"6","author":"SH Brooks","year":"1958","unstructured":"Brooks, S.H.: A discussion of random methods for seeking maxima. Oper. Res. 6(2), 244\u2013251 (1958). https:\/\/doi.org\/10.1287\/opre.6.2.244","journal-title":"Oper. Res."},{"issue":"1","key":"2114_CR32","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20(1), 172\u2013191 (2009). https:\/\/doi.org\/10.1137\/080724083","journal-title":"SIAM J. Optim."},{"key":"2114_CR33","doi-asserted-by":"publisher","unstructured":"Forrester, A., Sobester, A., Keane, A.: Engineering Design via Surrogate Modelling, pp. 195\u2013203. John Wiley & Sons, Ltd, (2008). https:\/\/doi.org\/10.1002\/9780470770801.app1","DOI":"10.1002\/9780470770801.app1"},{"key":"2114_CR34","doi-asserted-by":"publisher","unstructured":"Zhou, L., Wang, S.-T., Choi, S., Pichler, H., Lukin, M.D.: Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices. Phys. Rev. X 10(2) (2020). https:\/\/doi.org\/10.1103\/physrevx.10.021067","DOI":"10.1103\/physrevx.10.021067"},{"key":"2114_CR35","doi-asserted-by":"publisher","unstructured":"Shaydulin, R., Safro, I., Larson, J.: Multistart methods for quantum approximate optimization. In: Proceedings of the IEEE High Performance Extreme Computing Conference (2019). https:\/\/doi.org\/10.1109\/hpec.2019.8916288","DOI":"10.1109\/hpec.2019.8916288"},{"issue":"3","key":"2114_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3338517","volume":"45","author":"C Cartis","year":"2019","unstructured":"Cartis, C., Fiala, J., Marteau, B., Roberts, L.: Improving the flexibility and robustness of model-based derivative-free optimization solvers. ACM Trans. Math. Softw. 45(3), 1\u201341 (2019). https:\/\/doi.org\/10.1145\/3338517","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"2114_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1377612.1377613","volume":"35","author":"W Huyer","year":"2008","unstructured":"Huyer, W., Neumaier, A.: SNOBFIT - stable noisy optimization by branch and fit. ACM Trans. Math. Softw. 35(2), 1\u201325 (2008). https:\/\/doi.org\/10.1145\/1377612.1377613","journal-title":"ACM Trans. Math. Softw."},{"key":"2114_CR38","unstructured":"Nogueira, F.: Bayesian Optimization: Open source constrained global optimization tool for Python (2014\u2013). https:\/\/github.com\/fmfn\/BayesianOptimization"}],"updated-by":[{"DOI":"10.1007\/s11590-024-02135-8","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000}}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02114-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02114-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02114-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T06:31:30Z","timestamp":1719988290000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02114-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,7]]},"references-count":38,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["2114"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02114-z","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s11590-024-02135-8","asserted-by":"object"}]},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,7]]},"assertion":[{"value":"7 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2024","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s11590-024-02135-8","URL":"https:\/\/doi.org\/10.1007\/s11590-024-02135-8","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}