{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,9]],"date-time":"2026-10-09T15:00:58Z","timestamp":1791558058889,"version":"4.3.4"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T00:00:00Z","timestamp":1754611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T00:00:00Z","timestamp":1754611200000},"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":["12425115"],"award-info":[{"award-number":["12425115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271127"],"award-info":[{"award-number":["12271127"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62176073"],"award-info":[{"award-number":["62176073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Postdoctoral Fellowship Program of CPSF","award":["GZC20233475"],"award-info":[{"award-number":["GZC20233475"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s10898-025-01528-y","type":"journal-article","created":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T06:50:09Z","timestamp":1754635809000},"page":"803-834","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme"],"prefix":"10.1007","volume":"95","author":[{"given":"Jiazhen","family":"Wei","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4252-047X","authenticated-orcid":false,"given":"Wei","family":"Bian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,8]]},"reference":[{"key":"1528_CR1","unstructured":"Choromanski, K., Rowland, M., Sindhwani, V., Turner, R., Weller, A.: Structured evolution with compact architectures for scalable policy optimization. In: Proceedings of the 35th International Conference on Machine Learning. PMLR, pp. 970\u2013978, Stockholm, Sweden (2018)"},{"issue":"2","key":"1528_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/72.279181","volume":"5","author":"Y Bengio","year":"1997","unstructured":"Bengio, Y., Simard, P., Frasconi, P.: Learning long-term dependencies with gradient descent is difficult. IEEE Trans. Neural Netw. 5(2), 157\u2013166 (1997)","journal-title":"IEEE Trans. Neural Netw."},{"key":"1528_CR3","volume-title":"Evolutionary Computation: Toward a New Philosophy of Machine Intelligence","author":"DB Fogel","year":"2000","unstructured":"Fogel, D.B.: Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, Piscataway, NJ (2000)"},{"issue":"6","key":"1528_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/79.543973","volume":"13","author":"KS Tang","year":"1996","unstructured":"Tang, K.S., Man, K.F., Kwong, S., He, Q.: Genetic algorithms and their applications. IEEE Signal Process. Mag. 13(6), 22\u201327 (1996)","journal-title":"IEEE Signal Process. Mag."},{"key":"1528_CR5","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN\u201995-International Conference on Neural Networks, vol. 4, pp. 1942\u20131948. IEEE, Perth, WA, Australia (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"2\u20133","key":"1528_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo, M., Blum, C.: Ant colony optimization theory: A survey. Theor. Comput. Sci. 344(2\u20133), 243\u2013278 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"1528_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s11721-008-0021-5","volume":"3","author":"KN Krishnanand","year":"2009","unstructured":"Krishnanand, K.N., Ghose, D.: Glowworm swarm optimization for simultaneous capture of multiple local optima of multimodal functions. Swarm Intell. 3, 87\u2013124 (2009)","journal-title":"Swarm Intell."},{"issue":"1","key":"1528_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.A.: A comprehensive survey: Artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42(1), 21\u201357 (2014)","journal-title":"Artif. Intell. Rev."},{"issue":"7","key":"1528_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.neucom.2013.03.027","volume":"119","author":"A Atyabi","year":"2013","unstructured":"Atyabi, A., Luerssen, M.H., Powers, D.M.W.: PSO-based dimension reduction of EEG recordings: Implications for subject transfer in BCI. Neurocomputing 119(7), 319\u2013331 (2013)","journal-title":"Neurocomputing"},{"issue":"11","key":"1528_CR10","doi-asserted-by":"publisher","first-page":"8199","DOI":"10.1007\/s00500-019-04414-4","volume":"24","author":"Y Liang","year":"2020","unstructured":"Liang, Y., Wang, L.: Applying genetic algorithm and ant colony optimization algorithm into marine investigation path planning model. Soft. Comput. 24(11), 8199\u20138210 (2020)","journal-title":"Soft. Comput."},{"issue":"1","key":"1528_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1142\/S0218202517400061","volume":"27","author":"R Pinnau","year":"2017","unstructured":"Pinnau, R., Totzeck, C., Tse, O., Martin, S.: A consensus-based model for global optimization and its mean-field limit. Math. Models Methods Appl. Sci. 27(1), 183\u2013204 (2017)","journal-title":"Math. Models Methods Appl. Sci."},{"key":"1528_CR12","doi-asserted-by":"crossref","unstructured":"Carrillo, J.A., Jin, S., Li, L., Zhu, Y.: A consensus-based global optimization method for high dimensional machine learning problems. ESAIM Control Optim. Calc. Var. 27(S5) (2021)","DOI":"10.1051\/cocv\/2020046"},{"key":"1528_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2023.113859","volume":"174","author":"G Borghi","year":"2023","unstructured":"Borghi, G., Grassi, S., Pareschi, L.: Consensus based optimization with memory effects: Random selection and applications. Chaos, Solitons Fractals 174, 113859 (2023)","journal-title":"Chaos, Solitons Fractals"},{"issue":"6","key":"1528_CR14","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1142\/S0218202518500276","volume":"28","author":"JA Carrillo","year":"2018","unstructured":"Carrillo, J.A., Choi, Y.P., Totzeck, C., Tse, O.: An analytical framework for consensus-based global optimization method. Math. Models Meth. Appl. Sci. 28(6), 1037\u20131066 (2018)","journal-title":"Math. Models Meth. Appl. Sci."},{"issue":"4","key":"1528_CR15","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.4208\/cicp.OA-2021-0144","volume":"31","author":"JR Chen","year":"2022","unstructured":"Chen, J.R., Jin, S., Lyu, L.Y.: A consensus-based global optimization method with adaptive momentum estimation. Commun. Comput. Phys. 31(4), 1296\u20131316 (2022)","journal-title":"Commun. Comput. Phys."},{"issue":"4","key":"1528_CR16","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1017\/S0956792523000293","volume":"35","author":"K Riedl","year":"2024","unstructured":"Riedl, K.: Leveraging memory effects and gradient information in consensus-based optimisation: On global convergence in mean-field law. Eur. J. Appl. Math. 35(4), 483\u2013514 (2024)","journal-title":"Eur. J. Appl. Math."},{"key":"1528_CR17","doi-asserted-by":"crossref","unstructured":"Fornasier, M., Richt\u00e1rik, P., Riedl, K., Sun, L.: Consensus-based optimisation with truncated noise. Eur. J. Appl. Math., 1\u201324 (2024)","DOI":"10.1017\/S095679252400007X"},{"issue":"14","key":"1528_CR18","doi-asserted-by":"publisher","first-page":"2725","DOI":"10.1142\/S0218202520500530","volume":"30","author":"M Fornasier","year":"2020","unstructured":"Fornasier, M., Huang, H., Pareschi, L., Sunnen, P.: Consensus-based optimization on hypersurfaces: Well-posedness and mean-field limit. Math. Models Methods Appl. Sci. 30(14), 2725\u20132751 (2020)","journal-title":"Math. Models Methods Appl. Sci."},{"issue":"237","key":"1528_CR19","first-page":"1","volume":"22","author":"M Fornasier","year":"2021","unstructured":"Fornasier, M., Huang, H., Pareschi, L., Sunnen, P.: Consensus-based optimization on the sphere II: Convergence to global minimizers and machine learning. J. Mach. Learn. Res. 22(237), 1\u201355 (2021)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1528_CR20","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/22M1471304","volume":"33","author":"G Borghi","year":"2023","unstructured":"Borghi, G., Herty, M., Pareschi, L.: Constrained consensus-based optimization. SIAM J. Optim. 33(1), 211\u2013236 (2023)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1528_CR21","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1137\/22M1543367","volume":"62","author":"H Huang","year":"2024","unstructured":"Huang, H., Qiu, J.N., Riedl, K.: Consensus-based optimization for saddle point problems. SIAM J. Control. Optim. 62(2), 1093\u20131121 (2024)","journal-title":"SIAM J. Control. Optim."},{"issue":"12","key":"1528_CR22","doi-asserted-by":"publisher","first-page":"2417","DOI":"10.1142\/S0218202520500463","volume":"30","author":"S-Y Ha","year":"2020","unstructured":"Ha, S.-Y., Jin, S., Kim, D.: Convergence of a first-order consensus-based global optimization algorithm. Math. Models Methods Appl. Sci. 30(12), 2417\u20132444 (2020)","journal-title":"Math. Models Methods Appl. Sci."},{"key":"1528_CR23","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00211-021-01174-y","volume":"147","author":"S-Y Ha","year":"2021","unstructured":"Ha, S.-Y., Jin, S., Kim, D.: Convergence and error estimates for time-discrete consensus-based optimization algorithms. Numer. Math. 147, 255\u2013282 (2021)","journal-title":"Numer. Math."},{"issue":"6","key":"1528_CR24","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1142\/S0218202522500245","volume":"32","author":"D Ko","year":"2022","unstructured":"Ko, D., Ha, S.-Y., Jin, S., Kim, D.: Convergence analysis of the discrete consensus-based optimization algorithm with random batch interactions and heterogeneous noises. Math. Models Methods Appl. Sci. 32(6), 1071\u20131107 (2022)","journal-title":"Math. Models Methods Appl. Sci."},{"issue":"6","key":"1528_CR25","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1142\/S0218202524400104","volume":"34","author":"S-Y Ha","year":"2024","unstructured":"Ha, S.-Y., Hwang, G., Kim, S.: Time-discrete momentum consensus-based optimization algorithm and its application to Lyapunov function approximation. Math. Models Methods Appl. Sci. 34(6), 1153\u20131204 (2024)","journal-title":"Math. Models Methods Appl. Sci."},{"issue":"237","key":"1528_CR26","first-page":"1","volume":"22","author":"M Fornasier","year":"2021","unstructured":"Fornasier, M., Huang, H., Pareschi, L., Sunnen, P.: Consensus-based optimization on the sphere: Convergence to global minimizers and machine learning. J. Mach. Learn. Res. 22(237), 1\u201355 (2021)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"1528_CR27","doi-asserted-by":"publisher","first-page":"2973","DOI":"10.1137\/22M1527805","volume":"34","author":"M Fornasier","year":"2024","unstructured":"Fornasier, M., Klock, T., Riedl, K.: Consensus-based optimization methods converge globally. SIAM J. Optim. 34(3), 2973\u20133004 (2024)","journal-title":"SIAM J. Optim."},{"key":"1528_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-048-3","volume-title":"Probability Theory","author":"A Klenke","year":"2008","unstructured":"Klenke, A.: Probability Theory. Springer, London (2008)"},{"key":"1528_CR29","volume-title":"A Probability Path","author":"SI Resnick","year":"1999","unstructured":"Resnick, S.I.: A Probability Path. Birkh\u00e4user, Boston, MA (1999)"},{"key":"1528_CR30","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.Y., Krzysztof, C., Scheinberg, K.: A theoretical and empirical comparison of gradient approximations in derivative-free optimization. Found. Comput. Math. 22, 507\u2013560 (2022)","journal-title":"Found. Comput. Math."},{"issue":"214","key":"1528_CR31","first-page":"1","volume":"25","author":"JA Carrillo","year":"2024","unstructured":"Carrillo, J.A., Trillos, N.G., Li, S., Zhu, Y.: FedCBO: Reaching group consensus in clustered federated learning through consensus-based optimization. J. Mach. Learn. Res. 25(214), 1\u201351 (2024)","journal-title":"J. Mach. Learn. Res."},{"key":"1528_CR32","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. 175, 69\u2013107 (2019)","journal-title":"Math. Program."},{"key":"1528_CR33","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 \u2013 A simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11, 341\u2013359 (1997)","journal-title":"J. Global Optim."},{"key":"1528_CR34","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s10898-004-9972-2","volume":"31","author":"MM Ali","year":"2005","unstructured":"Ali, M.M., Khompatraporn, C., Zabinsky, Z.B.: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J. Global Optim. 31, 635\u2013672 (2005)","journal-title":"J. Global Optim."},{"issue":"4","key":"1528_CR35","first-page":"150","volume":"2","author":"M Jamil","year":"2013","unstructured":"Jamil, M., Yang, X.-S.: A literature survey of benchmark functions for global optimisation problems. Int. J. Math. Model. Numer. Optim. 2(4), 150\u2013194 (2013)","journal-title":"Int. J. Math. Model. Numer. Optim."},{"issue":"2","key":"1528_CR36","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1137\/18M1231559","volume":"30","author":"Y Cui","year":"2020","unstructured":"Cui, Y., He, Z.Y., Pang, J.-S.: Multicomposite nonconvex optimization for training deep neural networks. SIAM J. Optim. 30(2), 1693\u20131723 (2020)","journal-title":"SIAM J. Optim."},{"key":"1528_CR37","first-page":"1","volume":"24","author":"W Liu","year":"2023","unstructured":"Liu, W., Liu, X., Chen, X.J.: An inexact augmented Lagrangian algorithm for training leaky ReLU neural network with group sparsity. J. Mach. Learn. Res. 24, 1\u201343 (2023)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01528-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-025-01528-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01528-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,31]],"date-time":"2026-08-31T12:20:25Z","timestamp":1788178825000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-025-01528-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,8]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["1528"],"URL":"https:\/\/doi.org\/10.1007\/s10898-025-01528-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,8]]},"assertion":[{"value":"31 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that there is no Conflict of interest.","order":1,"name":"Ethics","label":"Conflicts of Interest","group":{"name":"EthicsHeading","label":"Declarations"}}]}}