{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T07:10:03Z","timestamp":1750317003333,"version":"3.41.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T00:00:00Z","timestamp":1748217600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T00:00:00Z","timestamp":1748217600000},"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","12271127","62176073"],"award-info":[{"award-number":["12425115","12271127","62176073"]}],"id":[{"id":"10.13039\/501100001809","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,7]]},"DOI":"10.1007\/s10915-025-02936-8","type":"journal-article","created":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T17:48:08Z","timestamp":1748281688000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Smoothing Iterative Consensus-based Optimization Algorithm for Nonsmooth Nonconvex Optimization Problems with Global Optimality"],"prefix":"10.1007","volume":"104","author":[{"given":"Jiazhen","family":"Wei","sequence":"first","affiliation":[]},{"given":"Wei","family":"Bian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,26]]},"reference":[{"key":"2936_CR1","doi-asserted-by":"crossref","unstructured":"Benfenati, A., Borghi, G., Pareschi, L.: Binary interaction methods for high dimensional global optimization and machine learning. Appl. Math. Optim. 86(9) (2022)","DOI":"10.1007\/s00245-022-09836-5"},{"issue":"3","key":"2936_CR2","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1137\/120864908","volume":"23","author":"W Bian","year":"2013","unstructured":"Bian, W., Chen, X.J.: Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization. SIAM J. Optim. 23(3), 1718\u20131741 (2013)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2936_CR3","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1109\/TNNLS.2013.2278427","volume":"25","author":"W Bian","year":"2014","unstructured":"Bian, W., Chen, X.J.: Neural network for nonsmooth, nonconvex constrained minimization via smooth approximation. IEEE Trans. Neural Netw. Learn. Syst. 25(3), 545\u2013556 (2014)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"1","key":"2936_CR4","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1137\/18M1186009","volume":"58","author":"W Bian","year":"2020","unstructured":"Bian, W., Chen, X.J.: A smoothing proximal gradient algorithm for nonsmooth convex regression with cardinality penalty. SIAM J. Numer. Anal. 58(1), 858\u2013883 (2020)","journal-title":"SIAM J. Numer. Anal."},{"key":"2936_CR5","doi-asserted-by":"crossref","unstructured":"Borghi, G., Grassi, S., Pareschi, L.: Consensus based optimization with memory effects: Random selection and applications. Chaos Solitons Fractals 174(113859) (2023)","DOI":"10.1016\/j.chaos.2023.113859"},{"key":"2936_CR6","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":"2936_CR7","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, 1\u201351 (2024)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"2936_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-012-0569-0","volume":"134","author":"XJ Chen","year":"2012","unstructured":"Chen, X.J.: Smoothing methods for nonsmooth, nonconvex minimization. Math. Program. 134(1), 71\u201399 (2012)","journal-title":"Math. Program."},{"key":"2936_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5320-4","volume-title":"Large Deviations Techniques and Applications","author":"A Dembo","year":"1998","unstructured":"Dembo, A., Zeitouni, O.: Large Deviations Techniques and Applications. Springer, Berlin, Heidelberg (1998)"},{"issue":"237","key":"2936_CR10","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."},{"key":"2936_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01585737","volume":"46","author":"R Ge","year":"1990","unstructured":"Ge, R.: A filled function method for finding a global minimizer of a function of several variables. Math. Program. 46, 191\u2013204 (1990)","journal-title":"Math. Program."},{"issue":"6","key":"2936_CR12","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1142\/S0218202524400104","volume":"34","author":"SY 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":"12","key":"2936_CR13","doi-asserted-by":"publisher","first-page":"2417","DOI":"10.1142\/S0218202520500463","volume":"30","author":"SY 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":"2936_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00211-021-01174-y","volume":"147","author":"SY 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":"3","key":"2936_CR15","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01396702","volume":"34","author":"E Hansen","year":"1980","unstructured":"Hansen, E.: Global optimisation using interval analysis - the multi-dimensional case. Numer. Math. 34(3), 247\u2013270 (1980)","journal-title":"Numer. Math."},{"key":"2936_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms I","author":"JB Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.B., Lemarechal, C.: Convex Analysis and Minimization Algorithms I. Springer-Verlag, Berlin (1993)"},{"issue":"1","key":"2936_CR17","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 comprehensive survey: Artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42(1), 21\u201357 (2014)","journal-title":"Artif. Intell. Rev."},{"issue":"6","key":"2936_CR18","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."},{"key":"2936_CR19","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/0906002","volume":"6","author":"AV Levy","year":"1985","unstructured":"Levy, A.V., Montalvo, A.: The tunneling algorithm for the global minimization of functions. SIAM J. Sci. Stat. Comput. 6, 2\u201329 (1985)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"4","key":"2936_CR20","doi-asserted-by":"publisher","first-page":"4618","DOI":"10.1016\/j.eswa.2011.09.076","volume":"39","author":"BC Mohan","year":"2012","unstructured":"Mohan, B.C., Baskaran, R.: A survey: Ant colony optimization based recent research and implementation on several engineering domain. Expert Syst. Appl. 39(4), 4618\u20134627 (2012)","journal-title":"Expert Syst. Appl."},{"key":"2936_CR21","volume-title":"Interval Analysis","author":"RE Moore","year":"1966","unstructured":"Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs, NJ (1966)"},{"key":"2936_CR22","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","volume":"19","author":"DR Morrison","year":"2016","unstructured":"Morrison, D.R., Jacobson, S.H., Sauppe, J.J., Sewell, E.C.: Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discrete Optim. 19, 79\u2013102 (2016)","journal-title":"Discrete Optim."},{"key":"2936_CR23","doi-asserted-by":"crossref","unstructured":"Pandiya, P., Widodo, W., Salmah, Endrayanto, I.: Non parameter-filled function for global optimization. Appl. Math. Comput. 391, 125642 (2021)","DOI":"10.1016\/j.amc.2020.125642"},{"issue":"1","key":"2936_CR24","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":"2936_CR25","volume-title":"A Probability Path","author":"SI Resnick","year":"1999","unstructured":"Resnick, S.I.: A Probability Path. Birkh\u00e4user Boston, MA (1999)"},{"key":"2936_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"R Rockafellar","year":"1998","unstructured":"Rockafellar, R., Wets, R.B.: Variational Analysis. Springer, New York (1998)"},{"issue":"12","key":"2936_CR27","first-page":"5208","volume":"217","author":"R Thangaraj","year":"2011","unstructured":"Thangaraj, R., Pant, M., Abraham, A., Bouvry, P.: Particle swarm optimization: Hybridization perspectives and experimental illustrations. Appl. Math. Comput. 217(12), 5208\u20135226 (2011)","journal-title":"Appl. Math. Comput."},{"key":"2936_CR28","doi-asserted-by":"crossref","unstructured":"Totzeck, C.: Trends in consensus-based optimization. In: Bellomo, N., Carrillo, J.A., Tadmor, E. (eds.) Active Particles, vol. 3, pp. 201\u2013226. Springer International Publishing, Cham (2022)","DOI":"10.1007\/978-3-030-93302-9_6"},{"key":"2936_CR29","doi-asserted-by":"publisher","first-page":"6026","DOI":"10.3934\/mbe.2020320","volume":"17","author":"C Totzeck","year":"2020","unstructured":"Totzeck, C., Wolfram, M.T.: Consensus-based global optimization with personal best. Math. Biosci. Eng. 17, 6026\u20136044 (2020)","journal-title":"Math. Biosci. Eng."},{"key":"2936_CR30","first-page":"1","volume":"24","author":"L Wei","year":"2023","unstructured":"Wei, L., Xin, L., 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 Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02936-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02936-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02936-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T06:41:07Z","timestamp":1750315267000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02936-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,26]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2936"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02936-8","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2025,5,26]]},"assertion":[{"value":"10 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"22"}}