{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T13:39:16Z","timestamp":1777037956595,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T00:00:00Z","timestamp":1763251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T00:00:00Z","timestamp":1763251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"DOE","award":["DE-FG02-02ER15344"],"award-info":[{"award-number":["DE-FG02-02ER15344"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62003159"],"award-info":[{"award-number":["62003159"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20200332"],"award-info":[{"award-number":["BK20200332"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10915-025-03119-1","type":"journal-article","created":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T16:21:53Z","timestamp":1763310113000},"update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Asymptotic Proximal Point Methods for Global Optimization"],"prefix":"10.1007","volume":"105","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-9806-8892","authenticated-orcid":false,"given":"Xiaopeng","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herschel","family":"Rabitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,16]]},"reference":[{"key":"3119_CR1","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-016-1065-8","volume":"163","author":"EG Birgin","year":"2017","unstructured":"Birgin, E.G., Gardenghi, J.L., Mart\u00ednez, J.M., Santos, S.A., Toint, P.L.: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math. Program. 163, 359\u2013368 (2017)","journal-title":"Math. Program."},{"issue":"2","key":"3119_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"issue":"2","key":"3119_CR3","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1137\/17M1114296","volume":"28","author":"Y Carmon","year":"2018","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Accelerated methods for nonconvex optimization. SIAM J. Optim. 28(2), 1751\u20131772 (2018)","journal-title":"SIAM J. Optim."},{"key":"3119_CR4","doi-asserted-by":"crossref","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Lower bounds for finding stationary points I. Mathematical Programming (2019)","DOI":"10.1007\/s10107-019-01406-y"},{"key":"3119_CR5","doi-asserted-by":"crossref","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Lower bounds for finding stationary points II. Mathematical Programming (2019)","DOI":"10.1007\/s10107-019-01431-x"},{"issue":"6","key":"3119_CR6","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1137\/090774100","volume":"20","author":"C Cartis","year":"2010","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization problems. SIAM J. Optim. 20(6), 2833\u20132852 (2010)","journal-title":"SIAM J. Optim."},{"key":"3119_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to derivative-free optimization","author":"A Conn","year":"2009","unstructured":"Conn, A., Scheinberg, K., Vicente, L.: Introduction to derivative-free optimization. MPS-SIAM series on optimization, SIAM, Philadelphia (2009)"},{"issue":"5","key":"3119_CR8","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., Wainwright, M.J., Wibisono, A.: Optimal rates for zero-order convex optimization: The power of two function evaluations. IEEE Trans. Information Theory 61(5), 2788\u20132806 (2015)","journal-title":"IEEE Trans. Information Theory"},{"issue":"5","key":"3119_CR9","doi-asserted-by":"publisher","first-page":"2442","DOI":"10.1137\/090754595","volume":"20","author":"W Hare","year":"2010","unstructured":"Hare, W., Planiden, C.: A redistributed proximal bundle method for nonconvex optimization. SIAM J. Optim. 20(5), 2442\u20132473 (2010)","journal-title":"SIAM J. Optim."},{"key":"3119_CR10","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s11228-016-0394-3","volume":"26","author":"W Hare","year":"2018","unstructured":"Hare, W., Planiden, C.: Computing proximal points of convex functions with inexact subgradients. Set-Valued Var. Anal 26, 469\u2013492 (2018)","journal-title":"Set-Valued Var. Anal"},{"key":"3119_CR11","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0124-6","volume":"116","author":"W Hare","year":"2009","unstructured":"Hare, W., Sagastiz\u00e1bal, C.: Computing proximal points of nonconvex functions. Math. Program. 116, 221\u2013258 (2009)","journal-title":"Math. Program."},{"key":"3119_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-015-9762-4","volume":"63","author":"W Hare","year":"2016","unstructured":"Hare, W., Sagastiz\u00e1bal, C., Solodov, M.: A proximal bundle method for nonsmooth nonconvex functions with inexact information. Comput. Optim. Appl. 63, 1\u201328 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"3119_CR13","first-page":"784","volume":"1","author":"EE Hazan","year":"2014","unstructured":"Hazan, E.E., Levy, K.Y.: Bandit convex optimization: Towards tight bounds. Adv. Neural. Inf. Process. Syst. 1, 784\u2013792 (2014)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"3119_CR14","unstructured":"Jin, C., Ge, R., Netrapalli, P., Kakade, S.M., Jordan, M.I.: How to escape saddle points efficiently. In: Proceedings of the 34th International Conference on Machine Learning (PMLR), vol.\u00a070, pp. 1724\u20131732 (2017)"},{"key":"3119_CR15","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1023\/A:1008321423879","volume":"13","author":"A Kaplan","year":"1998","unstructured":"Kaplan, A., Tichatschke, R.: Proximal point methods and nonconvex optimization. J. Global Optim. 13, 389\u2013406 (1998)","journal-title":"J. Global Optim."},{"issue":"2","key":"3119_CR16","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1145\/264029.264064","volume":"23","author":"L Kocis","year":"1997","unstructured":"Kocis, L., Whiten, W.J.: Computational investigations of low-discrepancy sequences. ACM Transactions on Mathematical Software 23(2), 266\u2013294 (1997)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"3119_CR17","unstructured":"Lee, J.D., Simchowitz, M., Jordan, M.I., Recht, B.: Gradient descent only converges to minimizers. In: Proceedings of the 28th Annual Conference on Learning Theory (PMLR), vol.\u00a049, pp. 1246\u20131257 (2016)"},{"key":"3119_CR18","unstructured":"Malherbe, C., Vayatis, N.: Global optimization of Lipschitz functions. In: Proceedings of the 34th International Conference on Machine Learning (PMLR), vol.\u00a070, pp. 2314\u20132323 (2017)"},{"key":"3119_CR19","doi-asserted-by":"crossref","unstructured":"Martinet, B.: R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives. Rev. Fran\u00e7aise Inf. Rech. Oper. pp. 154\u2013159 (1970)","DOI":"10.1051\/m2an\/197004R301541"},{"key":"3119_CR20","first-page":"246","volume":"26","author":"J Matyas","year":"1965","unstructured":"Matyas, J.: Random optimization. Autom. Remote. Control. 26, 246\u2013253 (1965)","journal-title":"Autom. Remote. Control."},{"key":"3119_CR21","volume-title":"Problem complexity and method efficiency in optimization","author":"A Nemirovski","year":"1983","unstructured":"Nemirovski, A., Yudin, D.: Problem complexity and method efficiency in optimization. John Wiley and Sons, New York (1983)"},{"key":"3119_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on Convex Optimization, 2nd edn. Springer International Publishing, Switzerland (2018)","edition":"2"},{"issue":"1","key":"3119_CR23","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton method and its global performance. Math. Program. 108(1), 177\u2013205 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"3119_CR24","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)","journal-title":"Found. Comput. Math."},{"key":"3119_CR25","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/j.swevo.2018.06.010","volume":"44","author":"KR Opara","year":"2019","unstructured":"Opara, K.R., Arabasb, J.: Differential evolution: A survey of theoretical analyses. Swarm Evol. Comput. 44, 546\u2013558 (2019)","journal-title":"Swarm Evol. Comput."},{"issue":"5","key":"3119_CR26","doi-asserted-by":"publisher","first-page":"S681","DOI":"10.1137\/16M1082299","volume":"39","author":"P Parpas","year":"2017","unstructured":"Parpas, P.: A multilevel proximal gradient algorithm for a class of composite optimization problems. SIAM J. Sci. Comput. 39(5), S681\u2013S701 (2017)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"3119_CR27","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1137\/140951679","volume":"28","author":"R Pasupathy","year":"2018","unstructured":"Pasupathy, R., Glynn, P., Ghosh, S., Hashemi, F.S.: On sampling rates in simulation-based recursions. SIAM J. Optim. 28(1), 45\u201373 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"3119_CR28","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1214\/aop\/1176990853","volume":"18","author":"R Pemantle","year":"1990","unstructured":"Pemantle, R.: Nonconvergence to unstable points in urn models and stochastic approximations. Ann. Probab. 18(2), 698\u2013712 (1990)","journal-title":"Ann. Probab."},{"issue":"3","key":"3119_CR29","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1287\/opre.16.3.690","volume":"16","author":"M Pincus","year":"1968","unstructured":"Pincus, M.: A closed form solution of certain programming problems. Oper. Res. 16(3), 690\u2013694 (1968)","journal-title":"Oper. Res."},{"issue":"6","key":"3119_CR30","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1287\/opre.18.6.1225","volume":"18","author":"M Pincus","year":"1970","unstructured":"Pincus, M.: A monte carlo method for the approximate solution of certain types of constrained optimization problems. Oper. Res. 18(6), 1225\u20131228 (1970)","journal-title":"Oper. Res."},{"key":"3119_CR31","volume-title":"Introduction to optimization","author":"BT Poliak","year":"1987","unstructured":"Poliak, B.T.: Introduction to optimization. Optimization Software Inc, New York (1987)"},{"key":"3119_CR32","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control. Optim. 14, 877\u2013898 (1976)","journal-title":"SIAM J. Control. Optim."},{"key":"3119_CR33","first-page":"1","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\u201311 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"3119_CR34","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11, 341\u2013359 (1997)","journal-title":"J. Global Optim."},{"issue":"2","key":"3119_CR35","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1109\/TIT.2016.2632162","volume":"63","author":"J Sun","year":"2017","unstructured":"Sun, J., Qu, Q., Wright, J.: Complete dictionary recovery over the sphere I: Overview and the geometric picture. IEEE Trans. Inf. Theory 63(2), 853\u2013884 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"3119_CR36","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1109\/TIT.2016.2632149","volume":"63","author":"J Sun","year":"2017","unstructured":"Sun, J., Qu, Q., Wright, J.: Complete dictionary recovery over the sphere II: Recovery by riemannian trust-region method. IEEE Trans. Inf. Theory 63(2), 885\u2013914 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3119_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-50871-6","volume-title":"Global Optimization","author":"A T\u00f6rn","year":"1989","unstructured":"T\u00f6rn, A., \u017dilinskas, A.: Global Optimization. Springer-Verlag, Berlin Heidelberg (1989)"},{"key":"3119_CR38","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1112\/jlms\/s1-11.1.55","volume":"11","author":"GN Watson","year":"1936","unstructured":"Watson, G.N.: The final problem: an account of the mock theta functions. J. London Math. Soc. 11, 55\u201380 (1936)","journal-title":"J. London Math. Soc."},{"key":"3119_CR39","volume-title":"Nature-Inspired Optimization Algorithms","author":"XS Yang","year":"2014","unstructured":"Yang, X.S.: Nature-Inspired Optimization Algorithms. Elsevier, London (2014)"},{"key":"3119_CR40","doi-asserted-by":"publisher","first-page":"3544","DOI":"10.1364\/OL.524854","volume":"49","author":"H Yu","year":"2024","unstructured":"Yu, H., Xu, X., Wang, Y., Zhang, E., Luo, X.: Asymptotic proximal point algorithm for wavefront sensorless adaptive optics. Opt. Lett. 49, 3544\u20133547 (2024)","journal-title":"Opt. Lett."},{"key":"3119_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3436-1","volume-title":"Theory of Global Random Search","author":"AA Zhigljavsky","year":"1991","unstructured":"Zhigljavsky, A.A.: Theory of Global Random Search. Mathematics and its Applications. Springer, Netherlands (1991)"},{"key":"3119_CR42","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10898-015-0357-5","volume":"65","author":"H Zidani","year":"2016","unstructured":"Zidani, H., De Cursi, J.E.S., Ellaia, R.: Numerical approximation of the solution in infinite dimensional global optimization using a representation formula. J. Glob. Optim. 65, 261\u2013281 (2016)","journal-title":"J. Glob. Optim."}],"updated-by":[{"DOI":"10.1007\/s10915-026-03211-0","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T00:00:00Z","timestamp":1770854400000}}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-03119-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s10915-025-03119-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-03119-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T10:50:40Z","timestamp":1770893440000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/s10915-025-03119-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,16]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["3119"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s10915-025-03119-1","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,16]]},"assertion":[{"value":"19 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2026","order":6,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":7,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s10915-026-03211-0","URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s10915-026-03211-0","order":9,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflict of interest exists.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"87"}}