{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T04:49:38Z","timestamp":1773809378442,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"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":["12222112"],"award-info":[{"award-number":["12222112"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10898-024-01441-w","type":"journal-article","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T02:05:02Z","timestamp":1737338702000},"page":"511-534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Iterative mix thresholding algorithm with continuation technique for mix sparse optimization and application"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6412-5804","authenticated-orcid":false,"given":"Yaohua","family":"Hu","sequence":"first","affiliation":[]},{"given":"Jian","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Xiaoqi","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,20]]},"reference":[{"key":"1441_CR1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"1441_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000015","volume":"4","author":"F Bach","year":"2011","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G.: Optimization with sparsity-inducing penalties. Found. Trends Mach. Learn. 4(1), 1\u2013106 (2011)","journal-title":"Found. Trends Mach. Learn."},{"issue":"25","key":"1441_CR3","first-page":"807","volume":"14","author":"S Bahmani","year":"2013","unstructured":"Bahmani, S., Raj, B., Boufounos, P.T.: Greedy sparsity-constrained optimization. J. Mach. Learn. Res. 14(25), 807\u2013841 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1441_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"1441_CR5","doi-asserted-by":"crossref","first-page":"1705","DOI":"10.1214\/08-AOS620","volume":"37","author":"PJ Bickel","year":"2009","unstructured":"Bickel, P.J., Ritov, Y., Tsybakov, A.B.: Simultaneous analysis of Lasso and Dantzig selector. Ann. Stat. 37, 1705\u20131732 (2009)","journal-title":"Ann. Stat."},{"issue":"1","key":"1441_CR6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1137\/090748160","volume":"53","author":"JD Blanchard","year":"2011","unstructured":"Blanchard, J.D., Cartis, C., Tanner, J.: Compressed sensing: How sharp is the restricted isometry property? SIAM Rev. 53(1), 105\u2013125 (2011)","journal-title":"SIAM Rev."},{"issue":"3","key":"1441_CR7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., Davies, M.E.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27(3), 265\u2013274 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"2","key":"1441_CR8","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1109\/JSTSP.2010.2042411","volume":"4","author":"T Blumensath","year":"2010","unstructured":"Blumensath, T., Davies, M.E.: Normalized iterative hard thresholding: guaranteed stability and performance. IEEE J. Sel. Top. Signal Process. 4(2), 298\u2013309 (2010)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"1441_CR9","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2013","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146, 459\u2013494 (2013)","journal-title":"Math. Program."},{"key":"1441_CR10","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"E Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51, 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1441_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1088\/0266-5611\/24\/3\/035020","volume":"24","author":"R Chartrand","year":"2008","unstructured":"Chartrand, R., Staneva, V.: Restricted isometry properties and nonconvex compressive sensing. Inverse Prob. 24, 1\u201314 (2008)","journal-title":"Inverse Prob."},{"key":"1441_CR12","doi-asserted-by":"crossref","unstructured":"Chen, J., Dai, G., Zhang, N.: An application of sparse-group Lasso regularization to equity portfolio optimization and sector selection. Ann. Oper. Res. (2019)","DOI":"10.1007\/s10479-019-03189-z"},{"issue":"5","key":"1441_CR13","doi-asserted-by":"crossref","first-page":"2832","DOI":"10.1137\/090761471","volume":"32","author":"X Chen","year":"2010","unstructured":"Chen, X., Xu, F., Ye, Y.: Lower bound theory of nonzero entries in solutions of $$\\ell _2$$-$$\\ell _p$$ minimization. SIAM J. Sci. Comput. 32(5), 2832\u20132852 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"1441_CR14","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1109\/TSP.2023.3262184","volume":"71","author":"A Cui","year":"2023","unstructured":"Cui, A., He, H., Xie, Z., Yan, W., Yang, H.: Iterative difference hard-thresholding algorithm for sparse signal recovery. IEEE Trans. Signal Process. 71, 1093\u20131102 (2023)","journal-title":"IEEE Trans. Signal Process."},{"key":"1441_CR15","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., Mol, C.D.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. 57, 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math."},{"issue":"4","key":"1441_CR16","doi-asserted-by":"crossref","first-page":"2010","DOI":"10.1137\/13090540X","volume":"6","author":"E Esser","year":"2013","unstructured":"Esser, E., Lou, Y., Xin, J.: A method for finding structured sparse solutions to nonnegative least squares problems with applications. SIAM J. Imag. Sci. 6(4), 2010\u20132046 (2013)","journal-title":"SIAM J. Imag. Sci."},{"issue":"456","key":"1441_CR17","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"1441_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-4948-7","volume-title":"A Mathematical Introduction to Compressive Sensing","author":"S Foucart","year":"2013","unstructured":"Foucart, S., Rauhut, H.: A Mathematical Introduction to Compressive Sensing. Springer, New York (2013)"},{"issue":"3","key":"1441_CR19","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"ET Hale","year":"2008","unstructured":"Hale, E.T., Yin, W.T., Zhang, Y.: Fixed-point continuation for $$\\ell _1$$-minimization: methodology and convergence. SIAM J. Optim. 19(3), 1107\u20131130 (2008)","journal-title":"SIAM J. Optim."},{"key":"1441_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-024-02068-1","author":"Y Hu","year":"2024","unstructured":"Hu, Y., Hu, X., Yang, X.: On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization. Math. Program. (2024). https:\/\/doi.org\/10.1007\/s10107-024-02068-1","journal-title":"Math. Program."},{"issue":"30","key":"1441_CR21","first-page":"1","volume":"18","author":"Y Hu","year":"2017","unstructured":"Hu, Y., Li, C., Meng, K., Qin, J., Yang, X.: Group sparse optimization via $$\\ell _{p, q}$$ regularization. J. Mach. Learn. Res. 18(30), 1\u201352 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"1441_CR22","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1007\/s10898-020-00955-3","volume":"79","author":"Y Hu","year":"2021","unstructured":"Hu, Y., Li, C., Meng, K., Yang, X.: Linear convergence of inexact descent methods and inexact proximal gradient algorithms for lower-order regularization problems. J. Global Optim. 79(4), 853\u2013883 (2021)","journal-title":"J. Global Optim."},{"issue":"2","key":"1441_CR23","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1214\/19-STS758","volume":"36","author":"J Huang","year":"2021","unstructured":"Huang, J., Jiao, Y., Jin, B., Liu, J., Lu, X., Yang, C.: A unified primal dual active set algorithm for nonconvex sparse recovery. Stat. Sci. 36(2), 215\u2013238 (2021)","journal-title":"Stat. Sci."},{"issue":"6","key":"1441_CR24","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1109\/LSP.2017.2693406","volume":"24","author":"Y Jiao","year":"2017","unstructured":"Jiao, Y., Jin, B., Lu, X.: Iterative soft\/hard thresholding with homotopy continuation for sparse recovery. IEEE Signal Process. Lett. 24(6), 784\u2013788 (2017)","journal-title":"IEEE Signal Process. Lett."},{"issue":"1","key":"1441_CR25","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/090775397","volume":"21","author":"M Lai","year":"2011","unstructured":"Lai, M., Wang, J.: An unconstrained $$\\ell _q$$ minimization with $$0\\le q \\le 1$$ for sparse solution of underdetermined linear systems. SIAM J. Optim. 21(1), 82\u2013101 (2011)","journal-title":"SIAM J. Optim."},{"key":"1441_CR26","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/s11590-012-0456-x","volume":"7","author":"HY Le","year":"2013","unstructured":"Le, H.Y.: Generalized subdifferentials of the rank function. Optim. Lett. 7, 731\u2013743 (2013)","journal-title":"Optim. Lett."},{"key":"1441_CR27","doi-asserted-by":"crossref","unstructured":"Leung, R.W.T., Jiang, X., Zong, X., Zhang, Y., Hu, X., Hu, Y., Qin, J.: CORN-condition orientated regulatory networks: bridging conditions to gene networks. Briefings Bioinf. 23(6), bbac402, 1\u20139 (2022)","DOI":"10.1093\/bib\/bbac402"},{"issue":"4","key":"1441_CR28","doi-asserted-by":"crossref","first-page":"2434","DOI":"10.1137\/140998135","volume":"25","author":"G Li","year":"2015","unstructured":"Li, G., Pong, T.K.: Global convergence of splitting methods for nonconvex composite optimization. SIAM J. Optim. 25(4), 2434\u20132460 (2015)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1441_CR29","doi-asserted-by":"crossref","first-page":"1614","DOI":"10.1137\/21M1443455","volume":"32","author":"W Li","year":"2022","unstructured":"Li, W., Bian, W., Toh, K.-C.: Difference-of-convex algorithms for a class of sparse group $$\\ell _0$$ regularized optimization problems. SIAM J. Optim. 32(3), 1614\u20131641 (2022)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1441_CR30","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1111\/biom.12292","volume":"71","author":"Y Li","year":"2015","unstructured":"Li, Y., Nan, B., Zhu, J.: Multivariate sparse group Lasso for the multivariate multiple linear regression with an arbitrary group structure. Biometrics 71(2), 354\u2013363 (2015)","journal-title":"Biometrics"},{"issue":"1","key":"1441_CR31","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-013-0714-4","volume":"147","author":"Z Lu","year":"2014","unstructured":"Lu, Z.: Iterative hard thresholding methods for $$l_0$$ regularized convex cone programming. Math. Program. 147(1), 125\u2013154 (2014)","journal-title":"Math. Program."},{"issue":"4","key":"1441_CR32","doi-asserted-by":"crossref","first-page":"2448","DOI":"10.1137\/100808071","volume":"23","author":"Z Lu","year":"2013","unstructured":"Lu, Z., Zhang, Y.: Sparse approximation via penalty decomposition methods. SIAM J. Optim. 23(4), 2448\u20132478 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1441_CR33","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1214\/07-AOS582","volume":"37","author":"N Meinshausen","year":"2009","unstructured":"Meinshausen, N., Yu, B.: Lasso-type recovery of sparse representations for high-dimensional data. Ann. Stat. 37(1), 246\u2013270 (2009)","journal-title":"Ann. Stat."},{"issue":"3","key":"1441_CR34","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell, D., Tropp, J.A.: CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 26(3), 301\u2013321 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"1441_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/19M1304799","volume":"14","author":"L Pan","year":"2021","unstructured":"Pan, L., Chen, X.: Group sparse optimization for images recovery using capped folded concave functions. SIAM J. Imag. Sci. 14(1), 1\u201325 (2021)","journal-title":"SIAM J. Imag. Sci."},{"key":"1441_CR36","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.neunet.2019.05.011","volume":"118","author":"DN Phan","year":"2019","unstructured":"Phan, D.N., Thi, H.A.L.: Group variable selection via $$\\ell _{p,0}$$ regularization and application to optimal scoring. Neural Netw. 118, 220\u2013234 (2019)","journal-title":"Neural Netw."},{"key":"1441_CR37","volume-title":"Differential Optical Absorption Spectroscopy: Principles and Applications","author":"U Platt","year":"2008","unstructured":"Platt, U., Stutz, J.: Differential Optical Absorption Spectroscopy: Principles and Applications. Springer, Berlin, Heidelberg (2008)"},{"issue":"3","key":"1441_CR38","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.ymeth.2014.03.006","volume":"67","author":"J Qin","year":"2014","unstructured":"Qin, J., Hu, Y., Xu, F., Yalamanchili, H.K., Wang, J.: Inferring gene regulatory networks by integrating ChIP-seq\/chip and transcriptome data via LASSO-type regularization methods. Methods 67(3), 294\u2013303 (2014)","journal-title":"Methods"},{"issue":"6","key":"1441_CR39","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1093\/bib\/bbab311","volume":"22","author":"J Qin","year":"2021","unstructured":"Qin, J., Hu, Y., Yao, J.-C., Leung, R.W.T., Zhou, Y., Qin, Y., Wang, J.: Cell fate conversion prediction by group sparse optimization method utilizing single-cell and bulk OMICs data. Brief. Bioinf. 22(6), 311 (2021)","journal-title":"Brief. Bioinf."},{"key":"1441_CR40","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Berlin (2009)"},{"issue":"2","key":"1441_CR41","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/10618600.2012.681250","volume":"22","author":"N Simon","year":"2013","unstructured":"Simon, N., Friedman, J., Hastie, T., Tibshirani, R.: A sparse-group Lasso. J. Comput. Graph. Stat. 22(2), 231\u2013245 (2013)","journal-title":"J. Comput. Graph. Stat."},{"issue":"10","key":"1441_CR42","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"JA Tropp","year":"2004","unstructured":"Tropp, J.A.: Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inf. Theory 50(10), 2231\u20132242 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1441_CR43","doi-asserted-by":"crossref","DOI":"10.1088\/1361-6420\/aa6699","volume":"33","author":"J Wang","year":"2017","unstructured":"Wang, J., Hu, Y., Li, C., Yao, J.-C.: Linear convergence of CQ algorithms and applications in gene regulatory network inference. Inverse Prob. 33(5), 055017 (2017)","journal-title":"Inverse Prob."},{"key":"1441_CR44","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/s10957-020-01779-7","volume":"188","author":"Y Wu","year":"2021","unstructured":"Wu, Y., Pan, S., Bi, S.: Kurdykaclojasiewicz property of zero-norm composite functions. J. Optim. Theory Appl. 188, 94\u2013112 (2021)","journal-title":"J. Optim. Theory Appl."},{"key":"1441_CR45","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/s10915-023-02393-1","volume":"98","author":"G Xiao","year":"2024","unstructured":"Xiao, G., Zhang, S., Bai, Z.-J.: Scaled proximal gradient methods for sparse optimization problems. J. Sci. Comput. 98, 2 (2024)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"1441_CR46","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1137\/120869997","volume":"23","author":"L Xiao","year":"2013","unstructured":"Xiao, L., Zhang, T.: A proximal-gradient homotopy method for the sparse least-squares problem. SIAM J. Optim. 23(2), 1062\u20131091 (2013)","journal-title":"SIAM J. Optim."},{"key":"1441_CR47","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"Z Xu","year":"2012","unstructured":"Xu, Z., Chang, X., Xu, F., Zhang, H.: $${L}_{1\/2}$$ regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learn. Syst. 23, 1013\u20131027 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"1","key":"1441_CR48","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"Yang, J., Zhang, Y.: Alternating direction algorithms for $$\\ell _1$$-problems in compressive sensing. SIAM J. Sci. Comput. 33(1), 250\u2013278 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1441_CR49","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2007","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. Roy. Stat. Soc. B 68(1), 49\u201367 (2007)","journal-title":"J. Roy. Stat. Soc. B"},{"issue":"166","key":"1441_CR50","first-page":"1","volume":"18","author":"X-T Yuan","year":"2018","unstructured":"Yuan, X.-T., Li, P., Zhang, T.: Gradient hard thresholding pursuit. J. Mach. Learn. Res. 18(166), 1\u201343 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"1441_CR51","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1007\/s10589-023-00496-x","volume":"86","author":"D Zhang","year":"2023","unstructured":"Zhang, D., Pan, S., Bi, S., Sun, D.: Zero-norm regularized problems: equivalent surrogates, proximal mm method and statistical error bound. Comput. Optim. Appl. 86, 627\u2013667 (2023)","journal-title":"Comput. Optim. Appl."},{"key":"1441_CR52","first-page":"1081","volume":"11","author":"T Zhang","year":"2010","unstructured":"Zhang, T.: Analysis of multi-stage convex relaxation for sparse regularization. J. Mach. Learn. Res. 11, 1081\u20131107 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1441_CR53","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/18M1219187","volume":"30","author":"Y-B Zhao","year":"2020","unstructured":"Zhao, Y.-B.: Optimal $$k$$-thresholding algorithms for sparse optimization problems. SIAM J. Optim. 30(1), 31\u201355 (2020)","journal-title":"SIAM J. Optim."},{"issue":"12","key":"1441_CR54","first-page":"1","volume":"22","author":"S Zhou","year":"2021","unstructured":"Zhou, S., Xiu, N., Qi, H.-D.: Global and quadratic convergence of newton hard-thresholding pursuit. J. Mach. Learn. Res. 22(12), 1\u201345 (2021)","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-024-01441-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-024-01441-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01441-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T06:12:16Z","timestamp":1740550336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-024-01441-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,20]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["1441"],"URL":"https:\/\/doi.org\/10.1007\/s10898-024-01441-w","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,20]]},"assertion":[{"value":"31 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2025","order":3,"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 no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Confict of interest"}},{"value":"The datasets generated during the DOAS study are available at .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data Availability Statements"}}]}}