{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T10:10:18Z","timestamp":1780049418048,"version":"3.53.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,8,19]],"date-time":"2020-08-19T00:00:00Z","timestamp":1597795200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,19]],"date-time":"2020-08-19T00:00:00Z","timestamp":1597795200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11771078"],"award-info":[{"award-number":["11771078"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20181258"],"award-info":[{"award-number":["BK20181258"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["NRF-RSS2016-004"],"award-info":[{"award-number":["NRF-RSS2016-004"]}],"id":[{"id":"10.13039\/501100001381","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","id":[{"id":"10.13039\/501100013156","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":[[2021,3]]},"DOI":"10.1007\/s10898-020-00943-7","type":"journal-article","created":{"date-parts":[[2020,8,19]],"date-time":"2020-08-19T02:02:46Z","timestamp":1597802566000},"page":"617-644","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems"],"prefix":"10.1007","volume":"79","author":[{"given":"Zhongming","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7595-0997","authenticated-orcid":false,"given":"Chongshou","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Lim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,8,19]]},"reference":[{"key":"943_CR1","unstructured":"Ahookhosh, M., Themelis, A., Patrinos, P.: A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima (2019). arXiv:1905.11904"},{"key":"943_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s00245-020-09692-1","author":"CD Alecsa","year":"2020","unstructured":"Alecsa, C.D., L\u00e1szl\u00f3, S.C., Pin\u0163a, T.: An extension of the second order dynamical system that models Nesterov\u2019s convex gradient method. Appl. Math. Optim. (2020). https:\/\/doi.org\/10.1007\/s00245-020-09692-1","journal-title":"Appl. Math. Optim."},{"key":"943_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1011253113155","volume":"9","author":"F Alvarez","year":"2001","unstructured":"Alvarez, F., Attouch, H.: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set Valued Anal. 9, 3\u201311 (2001)","journal-title":"Set Valued Anal."},{"key":"943_CR4","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\u2013backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"943_CR5","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/130910294","volume":"24","author":"H Attouch","year":"2014","unstructured":"Attouch, H., Peypouquet, J., Redont, P.: A dynamical approach to an inertial forward\u2013backward algorithm for convex minimization. SIAM J. Optim. 24, 232\u2013256 (2014)","journal-title":"SIAM J. Optim."},{"key":"943_CR6","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16, 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"943_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10107-007-0147-z","volume":"120","author":"A Auslender","year":"2009","unstructured":"Auslender, A., Teboulle, M.: Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities. Math. Program. 120, 27\u201348 (2009)","journal-title":"Math. Program."},{"key":"943_CR8","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1007\/s10957-019-01516-9","volume":"182","author":"HH Bauschke","year":"2019","unstructured":"Bauschke, H.H., Bolte, J., Chen, J., Teboulle, M., Wang, X.: On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity. J. Optim. Theory Appl. 182, 1068\u20131087 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"943_CR9","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":"943_CR10","doi-asserted-by":"crossref","first-page":"3208","DOI":"10.1137\/17M1130745","volume":"28","author":"HH Bauschke","year":"2018","unstructured":"Bauschke, H.H., Dao, M.N., Lindstrom, S.B.: Regularizing with Bregman\u2013Moreau envelopes. SIAM J. Optim. 28, 3208\u20133228 (2018)","journal-title":"SIAM J. Optim."},{"key":"943_CR11","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. Imaging Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"943_CR12","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"key":"943_CR13","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 or nonconvex and nonsmooth problems. Math. Program. 146, 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"943_CR14","doi-asserted-by":"crossref","first-page":"2131","DOI":"10.1137\/17M1138558","volume":"28","author":"J Bolte","year":"2018","unstructured":"Bolte, J., Sabach, S., Teboulle, M., Vaisbourd, Y.: First-order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems. SIAM J. Optim. 28, 2131\u20132151 (2018)","journal-title":"SIAM J. Optim."},{"key":"943_CR15","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."},{"key":"943_CR16","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"943_CR17","doi-asserted-by":"crossref","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, 1751\u20131772 (2018)","journal-title":"SIAM J. Optim."},{"key":"943_CR18","doi-asserted-by":"crossref","first-page":"2239","DOI":"10.1137\/15100463X","volume":"8","author":"C Chen","year":"2015","unstructured":"Chen, C., Chan, R.H., Ma, S., Yang, J.: Inertial proximal ADMM for linearly constrained separable convex optimization. SIAM J. Imaging Sci. 8, 2239\u20132267 (2015)","journal-title":"SIAM J. Imaging Sci."},{"key":"943_CR19","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, 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"943_CR20","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1007\/s10898-019-00819-5","volume":"76","author":"X Gao","year":"2020","unstructured":"Gao, X., Cai, X., Han, D.: A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems. J. Global Optim. 76, 863\u2013887 (2020)","journal-title":"J. Global Optim."},{"key":"943_CR21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156, 59\u201399 (2016)","journal-title":"Math. Program."},{"key":"943_CR22","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1109\/TSP.2017.2778695","volume":"66","author":"F Ghayem","year":"2018","unstructured":"Ghayem, F., Sadeghi, M., Babaie-Zadeh, M., Chatterjee, S., Skoglund, M., Jutten, C.: Sparse signal recovery using iterative proximal projection. IEEE Trans. Signal Process. 66, 879\u2013894 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"943_CR23","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\u2013Rachford splitting method for optimization problems involving hypoconvex functions. J. Global Optim. 72, 431\u2013441 (2018)","journal-title":"J. Global Optim."},{"key":"943_CR24","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.cam.2007.10.063","volume":"221","author":"D Han","year":"2008","unstructured":"Han, D.: A generalized proximal-point-based prediction-correction method for variational inequality problems. J. Comput. Appl. Math. 221, 183\u2013193 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"943_CR25","unstructured":"Hien, L.T.K., Gillis, N., Patrinos, P.: Inertial block mirror descent method for non-convex non-smooth optimization (2019). arXiv:1903.01818"},{"key":"943_CR26","doi-asserted-by":"crossref","first-page":"5917","DOI":"10.1109\/TSP.2018.2870353","volume":"66","author":"Y-P Hsieh","year":"2018","unstructured":"Hsieh, Y.-P., Kao, Y.-C., Mahabadi, R.K., Yurtsever, A., Kyrillidis, A., Cevher, V.: A non-Euclidean gradient descent framework for non-convex matrix factorization. IEEE Trans. Signal Process. 66, 5917\u20135926 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"943_CR27","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1561\/2200000058","volume":"10","author":"P Jain","year":"2017","unstructured":"Jain, P., Kar, P.: Non-convex optimization for machine learning. Found. Trends Mach. Learn. 10, 142\u2013336 (2017)","journal-title":"Found. Trends Mach. Learn."},{"key":"943_CR28","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10589-017-9896-7","volume":"67","author":"PR Johnstone","year":"2017","unstructured":"Johnstone, P.R., Moulin, P.: Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions. Comput. Optim. Appl. 67, 259\u2013292 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"943_CR29","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. In: Proceedings of NeurIPS, pp. 379\u2013387 (2015)"},{"key":"943_CR30","unstructured":"Liang, J., Monteiro, R.D., Sim, C.-K.: A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems (2019). arXiv:1905.07010"},{"key":"943_CR31","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10851-014-0523-2","volume":"51","author":"DA Lorenz","year":"2015","unstructured":"Lorenz, D.A., Pock, T.: An inertial forward-backward algorithm for monotone inclusions. J. Math. Imaging Vis. 51, 311\u2013325 (2015)","journal-title":"J. Math. Imaging Vis."},{"key":"943_CR32","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1109\/TIP.2015.2511584","volume":"25","author":"C Lu","year":"2016","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 (2016)","journal-title":"IEEE Trans. Image Process."},{"key":"943_CR33","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1137\/16M1099546","volume":"28","author":"H Lu","year":"2018","unstructured":"Lu, H., Freund, R.M., Nesterov, Y.: Relatively smooth convex optimization by first-order methods, and applications. SIAM J. Optim. 28, 333\u2013354 (2018)","journal-title":"SIAM J. Optim."},{"key":"943_CR34","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0377-0427(02)00906-8","volume":"155","author":"A Moudafi","year":"2003","unstructured":"Moudafi, A., Oliny, M.: Convergence of a splitting inertial proximal method for monotone operators. J. Comput. Appl. Math. 155, 447\u2013454 (2003)","journal-title":"J. Comput. Appl. Math."},{"key":"943_CR35","doi-asserted-by":"crossref","unstructured":"Mukkamala, M.C., Ochs, P., Pock, T., Sabach, S.: Convex-concave backtracking for inertial Bregman proximal gradient algorithms in non-convex optimization (2019). arXiv:1904.03537","DOI":"10.1137\/19M1298007"},{"key":"943_CR36","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for solving the convex programming problem with convergence rate O($$1\/k^2$$). Soviet Math. Dok. 27, 372\u2013376 (1983)","journal-title":"Soviet Math. Dok."},{"key":"943_CR37","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140, 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"943_CR38","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. Imaging Sci. 7, 1388\u20131419 (2014)","journal-title":"SIAM J. Imaging Sci."},{"key":"943_CR39","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/s10957-018-01452-0","volume":"181","author":"P Ochs","year":"2019","unstructured":"Ochs, P., Fadili, J., Brox, T.: Non-smooth non-convex Bregman minimization: unification and new algorithms. J. Optim. Theory Appl. 181, 244\u2013278 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"943_CR40","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1137\/040605412","volume":"4","author":"S Osher","year":"2005","unstructured":"Osher, S., Burger, M., Goldfarb, D., Xu, J., Yin, W.: An iterative regularization method for total variation-based image restoration. Multiscale Model. Simul. 4, 460\u2013489 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"943_CR41","doi-asserted-by":"crossref","first-page":"1756","DOI":"10.1137\/16M1064064","volume":"9","author":"T Pock","year":"2016","unstructured":"Pock, T., Sabach, S.: Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems. SIAM J. Imaging Sci. 9, 1756\u20131787 (2016)","journal-title":"SIAM J. Imaging Sci."},{"key":"943_CR42","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":"943_CR43","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Berlin (2009)"},{"key":"943_CR44","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10107-018-1284-2","volume":"170","author":"M Teboulle","year":"2018","unstructured":"Teboulle, M.: A simplified view of first order methods for optimization. Math. Program. 170, 67\u201396 (2018)","journal-title":"Math. Program."},{"key":"943_CR45","doi-asserted-by":"crossref","first-page":"2274","DOI":"10.1137\/16M1080240","volume":"28","author":"A Themelis","year":"2018","unstructured":"Themelis, A., Stella, L., Patrinos, P.: Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms. SIAM J. Optim. 28, 2274\u20132303 (2018)","journal-title":"SIAM J. Optim."},{"key":"943_CR46","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":"943_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."},{"issue":"6","key":"943_CR48","doi-asserted-by":"crossref","first-page":"1750030","DOI":"10.1142\/S0217595917500300","volume":"34","author":"Z Wu","year":"2017","unstructured":"Wu, Z., Li, M., Wang, D.Z., Han, D.: A symmetric alternating direction method of multipliers for separable nonconvex minimization problems. Asia Pac. J. Oper. Res. 34(6), 1750030 (2017)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"943_CR49","unstructured":"Yang, L.: Proximal gradient method with extrapolation and line search for a class of nonconvex and nonsmooth problems (2018). arXiv:1711.06831"},{"key":"943_CR50","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/070703983","volume":"1","author":"W Yin","year":"2008","unstructured":"Yin, W., Osher, S., Goldfarb, D., Darbon, J.: Bregman iterative algorithms for $$\\ell _1$$-minimization with applications to compressed sensing. SIAM J. Imaging Sci. 1, 143\u2013168 (2008)","journal-title":"SIAM J. Imaging Sci."},{"key":"943_CR51","first-page":"894","volume":"38","author":"C-H Zhang","year":"2010","unstructured":"Zhang, C.-H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38, 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"key":"943_CR52","doi-asserted-by":"crossref","first-page":"126515","DOI":"10.1109\/ACCESS.2019.2937005","volume":"7","author":"X Zhang","year":"2019","unstructured":"Zhang, X., Barrio, R., Mart\u00ednez, M.A., Jiang, H., Cheng, L.: Bregman proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. IEEE Access 7, 126515\u2013126529 (2019)","journal-title":"IEEE Access"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00943-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-020-00943-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00943-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T23:10:48Z","timestamp":1629328248000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-020-00943-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,19]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["943"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00943-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,19]]},"assertion":[{"value":"21 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}