{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T04:48:10Z","timestamp":1758862090840,"version":"3.37.3"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"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":["12001281","12001286","11771210"],"award-info":[{"award-number":["12001281","12001286","11771210"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013156","name":"Startup Foundation for Introducing Talent of Nanjing University of Information Science and Technology","doi-asserted-by":"publisher","award":["2020r003"],"award-info":[{"award-number":["2020r003"]}],"id":[{"id":"10.13039\/501100013156","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project funded by China Postdoctoral Science Foundation","award":["2022M711672"],"award-info":[{"award-number":["2022M711672"]}]},{"name":"Suqian Sci &Tech Program","award":["Z2020135","K202112"],"award-info":[{"award-number":["Z2020135","K202112"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10898-023-01299-4","type":"journal-article","created":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T05:04:25Z","timestamp":1686114265000},"page":"821-844","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems"],"prefix":"10.1007","volume":"86","author":[{"given":"Zhili","family":"Ge","sequence":"first","affiliation":[]},{"given":"Zhongming","family":"Wu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6649-1103","authenticated-orcid":false,"given":"Xin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Qin","family":"Ni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,7]]},"reference":[{"key":"1299_CR1","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/TCI.2015.2485078","volume":"1","author":"R Ahmad","year":"2015","unstructured":"Ahmad, R., Schniter, P.: Iteratively reweighted $$l_1$$ approaches to sparse composite regularization. IEEE Trans. Comput. Imag. 1, 220\u2013235 (2015)","journal-title":"IEEE Trans. Comput. Imag."},{"key":"1299_CR2","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"1299_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex analysis and monotone operator theory in Hilbert spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces. Springer, Berlin (2011)"},{"key":"1299_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, 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"1299_CR5","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1109\/TNNLS.2013.2278427","volume":"25","author":"W Bian","year":"2014","unstructured":"Bian, W., Chen, X.: Neural network for nonsmooth, nonconvex constrained minimization via smooth approximation. IEEE Trans. Neural Netw. Learn. Syst. 25, 545\u2013556 (2014)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"1299_CR6","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.S., Shiota, M.: Clark subgradients of stratifiable functions. SIAM J. Optim. 18, 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"key":"1299_CR7","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146, 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"1299_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s13675-015-0045-8","volume":"4","author":"RI Bo\u0163","year":"2016","unstructured":"Bo\u0163, R.I., Csetnek, E.R., L\u00e1szl\u00f3, S.C.: An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions. EURO J. Comput. Optim. 4, 3\u201325 (2016)","journal-title":"EURO J. Comput. Optim."},{"doi-asserted-by":"crossref","unstructured":"Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: IEEE International Conference on Acoustics, Speech and Signal Processing (IEEE-ICASSP) (2008)","key":"1299_CR9","DOI":"10.1109\/ICASSP.2008.4518498"},{"key":"1299_CR10","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-012-0569-0","volume":"134","author":"X Chen","year":"2012","unstructured":"Chen, X.: Smoothing methods for nonsmooth, nonconvex minimization. Math. Program. 134, 71\u201399 (2012)","journal-title":"Math. Program."},{"key":"1299_CR11","doi-asserted-by":"crossref","first-page":"4709","DOI":"10.1109\/TIP.2012.2214051","volume":"21","author":"X Chen","year":"2012","unstructured":"Chen, X., Ng, M.K., Zhang, C.: Non-Lipschitz-regularization and box constrained model for image restoration. IEEE Trans. Image Process. 21, 4709\u20134721 (2012)","journal-title":"IEEE Trans. Image Process."},{"key":"1299_CR12","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-012-0613-0","volume":"143","author":"X Chen","year":"2014","unstructured":"Chen, X., Ge, D., Wang, Z., Ye, Y.: Complexity of unconstrained $$l_2$$-$$l_p$$ minimization. Math. Program. 143, 371\u2013383 (2014)","journal-title":"Math. Program."},{"key":"1299_CR13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10589-013-9553-8","volume":"59","author":"X Chen","year":"2014","unstructured":"Chen, X., Zhou, W.: Convergence of the reweighted $$l_1$$ minimization algorithm for $$l_2$$-$$l_p$$ minimization. Comput. Optim. Appl. 59, 47\u201361 (2014)","journal-title":"Comput. Optim. Appl."},{"unstructured":"Clarke, F.H.: Nonsmooth analysis and optimization. In: Proceedings of the International Congress of Mathematicians (ICM) (1983)","key":"1299_CR14"},{"key":"1299_CR15","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward-backward splitting. Multiscale Model. Sim. 4, 1168\u20131200 (2005)","journal-title":"Multiscale Model. Sim."},{"key":"1299_CR16","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.acha.2008.09.001","volume":"26","author":"S Foucart","year":"2009","unstructured":"Foucart, S., Lai, M.: Sparsest solutions of underdetermined linear systems via $$l_q$$-minimization for $$0< q\\le 1$$. Appl. Comput. Harmon A. 26, 395\u2013407 (2009)","journal-title":"Appl. Comput. Harmon A."},{"key":"1299_CR17","doi-asserted-by":"crossref","first-page":"4686","DOI":"10.1109\/TSP.2009.2026004","volume":"57","author":"G Gasso","year":"2009","unstructured":"Gasso, G., Rakotomamonjy, A., Canu, S.: Recovering sparse signals with a certain family of nonconvex penalties and DC programming. IEEE Trans. Signal Process. 57, 4686\u20134698 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"1299_CR18","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.apnum.2022.04.008","volume":"179","author":"Z Ge","year":"2022","unstructured":"Ge, Z., Wu, Z., Zhang, X., Ni, Q.: A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems. Appl. Numer. Math. 179, 66\u201386 (2022)","journal-title":"Appl. Numer. Math."},{"doi-asserted-by":"crossref","unstructured":"Ghadimi, E., Feyzmahdavian, H.R., Johansson, M.: Global convergence of the heavy-ball method for convex optimization. arXiv:1412.7457 (2014)","key":"1299_CR19","DOI":"10.1109\/ECC.2015.7330562"},{"key":"1299_CR20","first-page":"2979","volume":"14","author":"P Gong","year":"2013","unstructured":"Gong, P., Ye, J., Zhang, C.: Multi-stage multitask feature learning. J. Mach. Learn. Res. 14, 2979\u20133010 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"1299_CR21","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s10898-018-0660-z","volume":"72","author":"K Guo","year":"2018","unstructured":"Guo, K., Han, D.: A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions. J. Global Optim. 72, 431\u2013441 (2018)","journal-title":"J. Global Optim."},{"key":"1299_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R Horst","year":"1999","unstructured":"Horst, R., Thoai, N.V.: DC programming: overview. J. Optim. Theory Appl. 103, 1\u201343 (1999)","journal-title":"J. Optim. Theory Appl."},{"doi-asserted-by":"crossref","unstructured":"Jacob, L., Obozinski, G., Vert, J.P.: Group LASSO with overlap and graph LASSO. In: International Conference on Machine Learning, 2009. ICML 2009. 433\u2013440 (2009)","key":"1299_CR23","DOI":"10.1145\/1553374.1553431"},{"key":"1299_CR24","doi-asserted-by":"crossref","first-page":"2284","DOI":"10.1137\/15M1048021","volume":"26","author":"B Jiang","year":"2016","unstructured":"Jiang, B., Liu, Y., Wen, Z.: $$L_p$$-norm regularization algorithms for optimization over permutation matrices. SIAM J. Optim. 26, 2284\u20132313 (2016)","journal-title":"SIAM J. Optim."},{"key":"1299_CR25","doi-asserted-by":"crossref","first-page":"112837","DOI":"10.1016\/j.cam.2020.112837","volume":"376","author":"M Kang","year":"2020","unstructured":"Kang, M.: Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems. J. Comput. Appl. Math. 376, 112837 (2020)","journal-title":"J. Comput. Appl. Math."},{"key":"1299_CR26","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 $$l_q$$ minimization with $$0<q\\le 1$$ for sparse solution of underdetermined linear systems. SIAM J. Optim. 21, 82\u2013101 (2011)","journal-title":"SIAM J. Optim."},{"key":"1299_CR27","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"M Lai","year":"2013","unstructured":"Lai, M., Xu, Y., Yin, W.: Improved iteratively reweighted least squares for unconstrained smoothed $$l_q$$ minimization. SIAM J. Numer. Anal. 51, 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"key":"1299_CR28","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10107-015-0939-5","volume":"158","author":"Y Liu","year":"2016","unstructured":"Liu, Y., Ma, S., Dai, Y., Zhang, S.: A smoothing SQP framework for a class of composite Lq minimization over polyhedron. Math. Program. 158, 467\u2013500 (2016)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Lu, C., Wei, Y., Lin, Z., Yan, S.: Proximal iteratively reweighted algorithm with multiple splitting for nonconvex sparsity optimization. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI-CAI) (2014)","key":"1299_CR29","DOI":"10.1609\/aaai.v28i1.8897"},{"key":"1299_CR30","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1109\/TIP.2015.2511584","volume":"25","author":"C Lu","year":"2015","unstructured":"Lu, C., Tang, J., Yan, S., Lin, Z.: Nonconvex nonsmooth low rank minimization via iteratively reweighted nuclear norm. IEEE Trans. Image Process. 25, 829\u2013839 (2015)","journal-title":"IEEE Trans. Image Process."},{"key":"1299_CR31","first-page":"3441","volume":"13","author":"K Mohan","year":"2012","unstructured":"Mohan, K., Fazel, M.: Iterative reweighted algorithms for matrix rank minimization. J. Mach. Learn. Res. 13, 3441\u20133473 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"1299_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory lectures on convex optimization: a basic course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory lectures on convex optimization: a basic course. Kluwer Academic Publishers, Boston (2004)"},{"key":"1299_CR33","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2007","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140, 125\u2013161 (2007)","journal-title":"Math. Program."},{"key":"1299_CR34","doi-asserted-by":"crossref","first-page":"1388","DOI":"10.1137\/130942954","volume":"7","author":"P Ochs","year":"2014","unstructured":"Ochs, P., Chen, Y., Brox, T., Pock, T.: iPiano: Inertial proximal algorithm for nonconvex optimization. SIAM J. Imag. Sci. 7, 1388\u20131419 (2014)","journal-title":"SIAM J. Imag. Sci."},{"key":"1299_CR35","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/140971518","volume":"8","author":"P Ochs","year":"2015","unstructured":"Ochs, P., Dosovitskiy, A., Brox, T., Pock, T.: On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision. SIAM J. Imag. Sci. 8, 331\u2013372 (2015)","journal-title":"SIAM J. Imag. Sci."},{"key":"1299_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4, 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1299_CR37","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"2015","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (2015)"},{"key":"1299_CR38","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1007\/s10898-017-0507-z","volume":"68","author":"T Sun","year":"2017","unstructured":"Sun, T., Jiang, H., Cheng, L.: Global convergence of proximal iteratively reweighted algorithm. J. Global Optim. 68, 815\u2013826 (2017)","journal-title":"J. Global Optim."},{"key":"1299_CR39","doi-asserted-by":"crossref","first-page":"5380","DOI":"10.1109\/TSP.2018.2868269","volume":"66","author":"T Sun","year":"2018","unstructured":"Sun, T., Jiang, H., Cheng, L., Zhu, W.: Iteratively linearized reweighted alternating direction method of multipliers for a class of nonconvex problems. IEEE Trans. Signal Process. 66, 5380\u20135391 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"1299_CR40","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"PD Tao","year":"1997","unstructured":"Tao, P.D., Le Thi Hoai, A.: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J. Global Optim. 11, 253\u2013285 (1997)","journal-title":"J. Global Optim."},{"key":"1299_CR41","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"PD Tao","year":"1998","unstructured":"Tao, P.D., Le Thi Hoai, A.: A DC optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8, 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"1299_CR42","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1137\/16M1055323","volume":"27","author":"B Wen","year":"2017","unstructured":"Wen, B., Chen, X., Pong, T.K.: Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. SIAM J. Optim. 27, 124\u2013145 (2017)","journal-title":"SIAM J. Optim."},{"key":"1299_CR43","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1007\/s10898-019-00789-8","volume":"75","author":"B Wen","year":"2019","unstructured":"Wen, B., Xue, X.: On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems. J. Global Optim. 75, 767\u2013787 (2019)","journal-title":"J. Global Optim."},{"key":"1299_CR44","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1137\/090747695","volume":"32","author":"Z Wen","year":"2009","unstructured":"Wen, Z., Yin, W., Goldfarb, D., Zhang, Y.: A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization and continuation. SIAM J. Sci. Comput. 32, 1832\u20131857 (2009)","journal-title":"SIAM J. Sci. Comput."},{"key":"1299_CR45","first-page":"1439","volume":"3","author":"J Weston","year":"2003","unstructured":"Weston, J., Elisseeff, A., Sch\u00f6lkopf, B., Kaelbling, P.: The use of zero-norm with linear models and kernel methods. J. Mach. Learn. Res. 3, 1439\u20131461 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"1299_CR46","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/TPAMI.2008.79","volume":"31","author":"J Wright","year":"2009","unstructured":"Wright, J., Yang, A.Y., Ganesh, A., Sastry, S.S., Ma, Y.: Robust face recognition via sparse representation. IEEE Trans. Pattern Anal. Mach. Intell. 31, 210\u2013227 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1299_CR47","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10589-019-00073-1","volume":"73","author":"Z Wu","year":"2019","unstructured":"Wu, Z., Li, M.: General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems. Comput. Optim. Appl. 73, 129\u2013158 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"1299_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10898-020-00939-3","volume":"79","author":"Z Wu","year":"2021","unstructured":"Wu, Z., Li, C., Li, M., Lim, A.: Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems. J. Global Optim. 79, 1\u201328 (2021)","journal-title":"J. Global Optim."},{"doi-asserted-by":"crossref","unstructured":"Xu, Y., Xu, Y., Yan, Y., Chen, J.: Distributed stochastic inertial-accelerated methods with delayed derivatives for nonconvex problems. arXiv:2107.11513 (2021)","key":"1299_CR49","DOI":"10.1137\/21M1435719"},{"unstructured":"Yang, L.: Proximal gradient method with extrapolation and line search for a class of nonconvex and nonsmooth problems. arXiv:1711.06831 (2018)","key":"1299_CR50"},{"key":"1299_CR51","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."},{"key":"1299_CR52","doi-asserted-by":"crossref","first-page":"2277","DOI":"10.3150\/12-BEJ452","volume":"19","author":"T Zhang","year":"2013","unstructured":"Zhang, T.: Multi-stage convex relaxation for feature selection. Bernoulli 19, 2277\u20132293 (2013)","journal-title":"Bernoulli"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01299-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-023-01299-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01299-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T10:08:22Z","timestamp":1688724502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-023-01299-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,7]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1299"],"URL":"https:\/\/doi.org\/10.1007\/s10898-023-01299-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2023,6,7]]},"assertion":[{"value":"24 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}