{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T13:06:12Z","timestamp":1774098372516,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"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":["11971078"],"award-info":[{"award-number":["11971078"]}],"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":["12271072"],"award-info":[{"award-number":["12271072"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB3304500"],"award-info":[{"award-number":["2022YFB3304500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10589-023-00508-w","type":"journal-article","created":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T16:02:05Z","timestamp":1690905725000},"page":"457-489","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Spectral conjugate gradient methods for vector optimization problems"],"prefix":"10.1007","volume":"86","author":[{"given":"Qing-Rui","family":"He","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8285-7881","authenticated-orcid":false,"given":"Chun-Rong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Sheng-Jie","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,1]]},"reference":[{"issue":"6","key":"508_CR1","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/j.aml.2006.06.015","volume":"20","author":"N Andrei","year":"2007","unstructured":"Andrei, N.: A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Appl. Math. Lett. 20(6), 645\u2013650 (2007)","journal-title":"Appl. Math. Lett."},{"issue":"4","key":"508_CR2","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1080\/10556780600822260","volume":"22","author":"N Andrei","year":"2007","unstructured":"Andrei, N.: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Optim. Methods Softw. 22(4), 561\u2013571 (2007)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"508_CR3","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/j.ejor.2009.11.030","volume":"204","author":"N Andrei","year":"2010","unstructured":"Andrei, N.: Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Eur. J. Oper. Res. 204(3), 410\u2013420 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"508_CR4","doi-asserted-by":"crossref","first-page":"3397","DOI":"10.1016\/j.cam.2010.05.002","volume":"234","author":"N Andrei","year":"2010","unstructured":"Andrei, N.: New accelerated conjugate gradient algorithms as a modification of Dai\u2013Yuan\u2019s computational scheme for unconstrained optimization. J. Comput. Appl. Math. 234(12), 3397\u20133410 (2010)","journal-title":"J. Comput. Appl. Math."},{"issue":"11","key":"508_CR5","doi-asserted-by":"crossref","first-page":"2289","DOI":"10.1080\/02331934.2014.947500","volume":"64","author":"MA Ansary","year":"2015","unstructured":"Ansary, M.A., Panda, G.: A modified quasi-Newton method for vector optimization problem. Optimization 64(11), 2289\u20132306 (2015)","journal-title":"Optimization"},{"issue":"3","key":"508_CR6","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s10589-020-00260-5","volume":"78","author":"PB Assun\u00e7\u00e3o","year":"2021","unstructured":"Assun\u00e7\u00e3o, P.B., Ferreira, O.P., Prudente, L.F.: Conditional gradient method for multiobjective optimization. Comput. Optim. Appl. 78(3), 741\u2013768 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"508_CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"issue":"4","key":"508_CR8","doi-asserted-by":"crossref","first-page":"2169","DOI":"10.1137\/120866415","volume":"23","author":"JY Bello Cruz","year":"2013","unstructured":"Bello Cruz, J.Y.: A subgradient method for vector optimization problems. SIAM J. Optim. 23(4), 2169\u20132182 (2013)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"508_CR9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00245-001-0003-0","volume":"43","author":"EG Birgin","year":"2001","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: A spectral conjugate gradient method for unconstrained optimization. Appl. Math. Optim. 43(2), 117\u2013128 (2001)","journal-title":"Appl. Math. Optim."},{"key":"508_CR10","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973365","volume-title":"Practical Augmented Lagrangian Methods for Constrained Optimization","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Practical Augmented Lagrangian Methods for Constrained Optimization. SIAM, New York (2014)"},{"issue":"4","key":"508_CR11","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1137\/S1052623403429093","volume":"15","author":"H Bonnel","year":"2005","unstructured":"Bonnel, H., Iusem, A.N., Svaiter, B.F.: Proximal methods in vector optimization. SIAM J. Optim. 15(4), 953\u2013970 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"508_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2006.09.070","volume":"183","author":"LC Ceng","year":"2007","unstructured":"Ceng, L.C., Yao, J.C.: Approximate proximal methods in vector optimization. Eur. J. Oper. Res. 183(1), 1\u201319 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"508_CR13","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10589-012-9495-6","volume":"54","author":"TD Chuong","year":"2013","unstructured":"Chuong, T.D.: Newton-like methods for efficient solutions in vector optimization. Comput. Optim. Appl. 54(3), 495\u2013516 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"508_CR14","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/100813026","volume":"23","author":"YH Dai","year":"2013","unstructured":"Dai, Y.H., Kou, C.X.: A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search. SIAM J. Optim. 23(1), 296\u2013320 (2013)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"508_CR15","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das, I., Dennis, J.E.: Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim. 8(3), 631\u2013657 (1998)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"508_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dola","year":"2002","unstructured":"Dola, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"4","key":"508_CR17","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1007\/s11075-018-0483-5","volume":"79","author":"M EI Moudden","year":"2018","unstructured":"EI Moudden, M., EI Ghali, A.: Multiple reduced gradient method for multiobjective optimization problems. Numer. Algorithms 79(4), 1257\u20131282 (2018)","journal-title":"Numer. Algorithms"},{"issue":"1","key":"508_CR18","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/s10957-020-01785-9","volume":"188","author":"M EI Moudden","year":"2021","unstructured":"EI Moudden, M., EI Mouatasim, A.: Accelerated diagonal steepest descent method for unconstrained multiobjective optimization. J. Optim. Theory Appl 188(1), 220\u2013242 (2021)","journal-title":"J. Optim. Theory Appl"},{"issue":"2","key":"508_CR19","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/s10957-019-01527-6","volume":"182","author":"P Faramarzi","year":"2019","unstructured":"Faramarzi, P., Amini, K.: A modified spectral conjugate gradient method with global convergence. J. Optim. Theory Appl. 182(2), 667\u2013690 (2019)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"508_CR20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher, R., Reeves, C.M.: Function minimization by conjugate gradients. Comput. J. 7(2), 149\u2013154 (1964)","journal-title":"Comput. J."},{"issue":"3","key":"508_CR21","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s001860000043","volume":"51","author":"J Fliege","year":"2000","unstructured":"Fliege, J., Svaiter, B.F.: Steepest descent methods for multicriteria optimization. Math. Methods Oper. Res. 51(3), 479\u2013494 (2000)","journal-title":"Math. Methods Oper. Res."},{"issue":"2","key":"508_CR22","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1137\/08071692X","volume":"20","author":"J Fliege","year":"2009","unstructured":"Fliege, J., Gra\u00f1a Drummond, L.M., Svaiter, B.F.: Newton\u2019s method for multiobjective optimization. SIAM J. Optim. 20(2), 602\u2013626 (2009)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"508_CR23","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10589-012-9501-z","volume":"54","author":"EH Fukuda","year":"2013","unstructured":"Fukuda, E.H., Gra\u00f1a Drummond, L.M.: Inexact projected gradient method for vector optimization. Comput. Optim. Appl. 54(3), 473\u2013493 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"508_CR24","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1007\/s10589-019-00146-1","volume":"76","author":"MLN Gon\u00e7alves","year":"2020","unstructured":"Gon\u00e7alves, M.L.N., Prudente, L.F.: On the extension of the Hager-Zhang conjugate gradient method for vector optimization. Comput. Optim. Appl. 76(3), 889\u2013916 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"508_CR25","first-page":"127099","volume":"425","author":"MLN Gon\u00e7alves","year":"2022","unstructured":"Gon\u00e7alves, M.L.N., Lima, F.S., Prudente, L.F.: A study of Liu-Storey conjugate gradient methods for vector optimization. Appl. Math. Comput. 425, 127099 (2022)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"508_CR26","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10589-022-00414-7","volume":"83","author":"MLN Gon\u00e7alves","year":"2022","unstructured":"Gon\u00e7alves, M.L.N., Lima, F.S., Prudente, L.F.: Globally convergent Newton-type methods for multiobjective optimization. Comput. Optim. Appl. 83(2), 403\u2013434 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"508_CR27","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/B:COAP.0000018877.86161.8b","volume":"28","author":"LM Gra\u00f1a Drummond","year":"2004","unstructured":"Gra\u00f1a Drummond, L.M., Iusem, A.N.: A projected gradient method for vector optimization problems. Comput. Optim. Appl. 28(1), 5\u201329 (2004)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"508_CR28","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.cam.2004.06.018","volume":"175","author":"LM Gra\u00f1a Drummond","year":"2005","unstructured":"Gra\u00f1a Drummond, L.M., Svaiter, B.F.: A steepest descent method for vector optimization. J. Comput. Appl. Math. 175(2), 395\u2013414 (2005)","journal-title":"J. Comput. Appl. Math."},{"issue":"5","key":"508_CR29","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1080\/02331934.2012.693082","volume":"63","author":"LM Gra\u00f1a Drummond","year":"2014","unstructured":"Gra\u00f1a Drummond, L.M., Raupp, F.M.P., Svaiter, B.F.: A quadratically convergent Newton method for vector optimization. Optimization 63(5), 661\u2013677 (2014)","journal-title":"Optimization"},{"issue":"3","key":"508_CR30","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1023\/A:1017536311488","volume":"110","author":"C Hillermeier","year":"2001","unstructured":"Hillermeier, C.: Generalized homotopy approach to multiobjective optimization. J. Optim. Theory Appl. 110(3), 557\u2013583 (2001)","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"508_CR31","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","volume":"10","author":"S Huband","year":"2006","unstructured":"Huband, S., Hingston, P., Barone, L., While, L.: A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10(5), 477\u2013506 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"508_CR32","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1080\/10556788.2016.1225213","volume":"32","author":"J Jian","year":"2017","unstructured":"Jian, J., Chen, Q., Jiang, X., Zeng, Y., Yin, J.: A new spectral conjugate gradient method for large-scale unconstrained optimization. Optim. Methods Softw. 32(3), 503\u2013515 (2017)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"508_CR33","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1016\/j.camwa.2018.10.002","volume":"77","author":"JK Liu","year":"2019","unstructured":"Liu, J.K., Feng, Y.M., Zou, L.M.: A spectral conjugate gradient method for solving large-scale unconstrained optimization. Comput. Math. Appl. 77(3), 731\u2013739 (2019)","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"508_CR34","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1137\/100784746","volume":"21","author":"A Lovison","year":"2011","unstructured":"Lovison, A.: Singular continuation: generating piecewise linear approximations to Pareto sets via global analysis. SIAM J. Optim. 21(2), 463\u2013490 (2011)","journal-title":"SIAM J. Optim."},{"issue":"8","key":"508_CR35","doi-asserted-by":"crossref","first-page":"1567","DOI":"10.1080\/00036811.2013.839781","volume":"93","author":"F Lu","year":"2014","unstructured":"Lu, F., Chen, C.R.: Newton-like methods for solving vector optimization problems. Appl. Anal. 93(8), 1567\u20131586 (2014)","journal-title":"Appl. Anal."},{"key":"508_CR36","doi-asserted-by":"crossref","unstructured":"Luc, D.T.: Theory of vector optimization. In: Lectures Notes in Economics and Mathematical Systems, vol. 319. Springer, Berlin (1989)","DOI":"10.1007\/978-3-642-50280-4"},{"issue":"3","key":"508_CR37","doi-asserted-by":"crossref","first-page":"2690","DOI":"10.1137\/17M1126588","volume":"28","author":"LR Lucambio P\u00e9rez","year":"2018","unstructured":"Lucambio P\u00e9rez, L.R., Prudente, L.F.: Nonlinear conjugate gradient methods for vector optimization. SIAM J. Optim. 28(3), 2690\u20132720 (2018)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"508_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3342104","volume":"45","author":"LR Lucambio P\u00e9rez","year":"2019","unstructured":"Lucambio P\u00e9rez, L.R., Prudente, L.F.: A Wolfe line search algorithm for vector optimization. ACM Trans. Math. Software 45(4), 1\u201323 (2019)","journal-title":"ACM Trans. Math. Software"},{"issue":"3","key":"508_CR39","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/j.ejor.2007.05.015","volume":"188","author":"E Miglierina","year":"2008","unstructured":"Miglierina, E., Molho, E., Recchioni, M.C.: Box-constrained multi-objective optimization: a gradient-like method without a priori scalarization. Eur. J. Oper. Res. 188(3), 662\u2013682 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"508_CR40","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10898-019-00802-0","volume":"75","author":"K Mita","year":"2019","unstructured":"Mita, K., Fukuda, E.H., Yamashita, N.: Nonmonotone line searches for unconstrained multiobjective optimization problems. J. Glob. Optim. 75(1), 63\u201390 (2019)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"508_CR41","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7(1), 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"issue":"6","key":"508_CR42","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1287\/opre.26.6.1073","volume":"26","author":"A Perry","year":"1978","unstructured":"Perry, A.: A modified conjugate gradient algorithm. Oper. Res. 26(6), 1073\u20131078 (1978)","journal-title":"Oper. Res."},{"issue":"1","key":"508_CR43","first-page":"35","volume":"3","author":"E Polak","year":"1969","unstructured":"Polak, E., Ribi\u00e8re, G.: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. Rev. Franca\u0327ise Inform. Rech. Op\u00e9r. S\u00e9r. Rouge 3(1), 35\u201343 (1969)","journal-title":"Rev. Franca\u0327ise Inform. Rech. Op\u00e9r. S\u00e9r. Rouge"},{"issue":"4","key":"508_CR44","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: The conjugate gradient method in extremal problems. USSR Comput. Math. Math. Phys. 9(4), 94\u2013112 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"508_CR45","doi-asserted-by":"crossref","unstructured":"Powell, M.J.D.: Nonconvex minimization calculations and the conjugate gradient method. In: Lecture Notes in Mathematics, vol. 1066. Springer, Berlin (1984)","DOI":"10.1007\/BFb0099521"},{"issue":"4","key":"508_CR46","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10898-007-9265-7","volume":"41","author":"O Sch\u00fctze","year":"2008","unstructured":"Sch\u00fctze, O., Laumanns, M., Coello Coello, C.A., Dellnitz, M., Talbi, E.G.: Convergence of stochastic search algorithms to finite size Pareto set approximations. J. Glob. Optim. 41(4), 559\u2013577 (2008)","journal-title":"J. Glob. Optim."},{"issue":"10","key":"508_CR47","doi-asserted-by":"crossref","first-page":"2082","DOI":"10.1080\/00207160.2017.1366457","volume":"95","author":"Z Sun","year":"2018","unstructured":"Sun, Z., Li, H., Wang, J., Tian, Y.: Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization. Int. J. Comput. Math. 95(10), 2082\u20132099 (2018)","journal-title":"Int. J. Comput. Math."},{"key":"508_CR48","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-023-00497-w","author":"H Tanabe","year":"2023","unstructured":"Tanabe, H., Fukuda, E.H., Yamashita, N.: An accelerated proximal gradient method for multiobjective optimization. Comput. Optim. Appl. (2023). https:\/\/doi.org\/10.1007\/s10589-023-00497-w","journal-title":"Comput. Optim. Appl."},{"key":"508_CR49","unstructured":"Toint, P.L.: Test problems for partially separable optimization and results for the routine PSPMIN. Technical Report, The University of Namur, Department of Mathematics, Belgium (1983)"},{"issue":"2","key":"508_CR50","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1080\/10556780701661344","volume":"23","author":"G Yu","year":"2008","unstructured":"Yu, G., Guan, L., Chen, W.: Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization. Optim. Methods Softw. 23(2), 275\u2013293 (2008)","journal-title":"Optim. Methods Softw."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00508-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00508-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00508-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T07:47:50Z","timestamp":1702885670000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00508-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,1]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["508"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00508-w","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,1]]},"assertion":[{"value":"20 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2023","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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}