{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:45:49Z","timestamp":1767339949689},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T00:00:00Z","timestamp":1682985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T00:00:00Z","timestamp":1682985600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10589-023-00487-y","type":"journal-article","created":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T07:02:46Z","timestamp":1683010966000},"page":"163-197","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On solving difference of convex functions programs with linear complementarity constraints"],"prefix":"10.1007","volume":"86","author":[{"given":"Hoai An","family":"Le Thi","sequence":"first","affiliation":[]},{"given":"Thi Minh Tam","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Tao Pham","family":"Dinh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,2]]},"reference":[{"key":"487_CR1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10957-007-9263-4","volume":"134","author":"C Audet","year":"2007","unstructured":"Audet, C., Savard, G., Zghal, W.: New branch-and-cut algorithm for bilevel linear programming. J. Optim. Theory Appl. 134, 353\u2013370 (2007)","journal-title":"J. Optim. Theory Appl."},{"key":"487_CR2","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF00941574","volume":"68","author":"JF Bard","year":"1991","unstructured":"Bard, J.F.: Some properties of the bilevel programming problem. J. Optim. Theory Appl. 68, 371\u2013378 (1991)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"487_CR3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0911017","volume":"11","author":"JF Bard","year":"1990","unstructured":"Bard, J.F., Mooreise, J.T.: A branch and bound algorithm for the bilevel programming problem. SIAM J. Sci. Stat. Comput. 11(2), 281\u2013292 (1990)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"1","key":"487_CR4","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/140978077","volume":"26","author":"OP Burdakov","year":"2016","unstructured":"Burdakov, O.P., Kanzow, C., Schwartz, A.: Mathematical programs with cardinality constraints: reformulation by complementarity-type constraints and a regularization method. SIAM J. Optim. 26(1), 397\u2013425 (2016)","journal-title":"SIAM J. Optim."},{"key":"487_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10107990015a","volume":"85","author":"F Facchinei","year":"1999","unstructured":"Facchinei, F., Jiang, H., Qi, L.: A smoothing method for mathematical programs with equilibrium constraints. Math. Program. 85, 107\u2013134 (1999)","journal-title":"Math. Program."},{"key":"487_CR6","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-642-45780-7_7","volume-title":"Ill-posed Variational Problems and Regularization Techniques","author":"M Fukushima","year":"1999","unstructured":"Fukushima, M., Pang, J.S.: Convergence of a smoothing continuation method for mathematical problems with complementarity constraints. In: Th\u00e9ra, M., Tichatschke, R. (eds.) Ill-posed Variational Problems and Regularization Techniques. Lecture Notes in Economics and Mathematical Systems, vol. 477, pp. 99\u2013101. Springer, Berlin (1999)"},{"key":"487_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1018359900133","volume":"10","author":"M Fukushima","year":"1998","unstructured":"Fukushima, M., Luo, Z.Q., Pang, J.S.: A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints. Comput. Optim. Appl. 10, 5\u201334 (1998)","journal-title":"Comput. Optim. Appl."},{"key":"487_CR8","unstructured":"Hau Luu, H.: Techniques avanc\u00e9es d\u2019apprentissage automatique bas"},{"issue":"2","key":"487_CR9","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1109\/59.867153","volume":"15","author":"BF Hobbs","year":"2000","unstructured":"Hobbs, B.F., Metzler, C.B., Pang, J.S.: Strategic gaming analysis for electric power systems: an MPEC approach. IEEE Trans. Power Syst. 15(2), 638\u2013645 (2000)","journal-title":"IEEE Trans. Power Syst."},{"key":"487_CR10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10957-004-5154-0","volume":"123","author":"X Hu","year":"2004","unstructured":"Hu, X., Ralph, D.: Convergence of a penalty method for mathematical programming with equilibrium constraints. J. Optim. Theory Appl. 123, 365\u2013390 (2004)","journal-title":"J. Optim. Theory Appl."},{"key":"487_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10898-010-9644-3","volume":"53","author":"J Hu","year":"2012","unstructured":"Hu, J., Mitchell, J.E., Pang, J.S., Yu, B.: On linear programs with linear complementarity constraints. J. Glob. Optim. 53, 29\u201351 (2012)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"487_CR12","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1080\/01630560500538797","volume":"27","author":"XX Huang","year":"2006","unstructured":"Huang, X.X., Yang, X.Q., Zhu, D.L.: A sequential smooth penalization approach to mathematical programs with complementarity constraints. Numer. Func. Anal. Opt. 27(1), 71\u201398 (2006)","journal-title":"Numer. Func. Anal. Opt."},{"issue":"1","key":"487_CR13","first-page":"221","volume":"169","author":"F Jara-Moroni","year":"2018","unstructured":"Jara-Moroni, F., Pang, J.S., W\u00e4chter, A.: A study of the difference-of-convex approach for solving linear programs with complementarity constraints. Math. Program., Special Issue: DC Programming - Theory, Algorithms and Applications 169(1), 221\u2013254 (2018)","journal-title":"Math. Program., Special Issue: DC Programming - Theory, Algorithms and Applications"},{"key":"487_CR14","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1023\/A:1022945316191","volume":"25","author":"H Jiang","year":"2003","unstructured":"Jiang, H., Ralph, D.: Extension of quasi-newton methods to mathematical programs with complementarity constraints. Comput. Optim. Appl. 25, 123\u2013150 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"487_CR15","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1590\/0101-7438.2014.034.03.0559","volume":"34","author":"JJ J\u00fadice","year":"2014","unstructured":"J\u00fadice, J.J.: Optimization with linear complementarity constraints. Pesquisa Operacional 34, 559\u2013584 (2014)","journal-title":"Pesquisa Operacional"},{"key":"487_CR16","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10898-006-9001-8","volume":"36","author":"JJ J\u00fadice","year":"2006","unstructured":"J\u00fadice, J.J., Sherali, H.D., Ribeiro, I.M., Faustino, A.M.: A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints. J. Glob. Optim. 36, 89\u2013114 (2006)","journal-title":"J. Glob. Optim."},{"key":"487_CR17","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10589-007-9017-0","volume":"37","author":"JJ J\u00fadice","year":"2007","unstructured":"J\u00fadice, J.J., Sherali, H.D., Ribeiro, I.M.: The eigenvalue complementarity problem. Comput. Optim. Appl. 37, 139\u2013156 (2007)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"487_CR18","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1137\/070705490","volume":"20","author":"A Kadrani","year":"2009","unstructured":"Kadrani, A., Dussault, J.P., Benchakroun, A.: A new regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optim. 20(1), 78\u2013103 (2009)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"487_CR19","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/100802487","volume":"23","author":"C Kanzow","year":"2013","unstructured":"Kanzow, C., Schwartz, A.: A new regularization method for mathematical programs with complementarity constraints with strong convergence properties. SIAM J. Optim. 23(2), 770\u2013798 (2013)","journal-title":"SIAM J. Optim."},{"key":"487_CR20","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1080\/10556780802102586","volume":"23","author":"G Kunapuli","year":"2008","unstructured":"Kunapuli, G., Bennett, K.P., Hu, J., Pang, J.S.: Classification model selection via bilevel programming. Optim. Methods Softw. 23, 475\u2013489 (2008)","journal-title":"Optim. Methods Softw."},{"key":"487_CR21","unstructured":"Le Thi, H.A.: DC Programming and DCA: http:\/\/www.lita.univ-lorraine.fr\/~lethi\/index.php\/en\/research\/dc-programming-and-dca.html(homepage) (2005)"},{"issue":"1","key":"487_CR22","first-page":"11","volume":"14","author":"HA Le Thi","year":"2003","unstructured":"Le Thi, H.A., Pham Dinh, T.: Large-scale molecular optimization from distance matrices by a DC optimization approach. SIAM J. Optim. 14(1), 11\u2013114 (2003)","journal-title":"SIAM J. Optim."},{"key":"487_CR23","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"HA Le Thi","year":"2005","unstructured":"Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"key":"487_CR24","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s10589-011-9398-y","volume":"50","author":"HA Le Thi","year":"2011","unstructured":"Le Thi, H.A., Pham Dinh, T.: On solving linear complementarity problems by DC programming and DCA. Comput. Optim. Appl. 50, 507\u2013524 (2011)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"487_CR25","first-page":"5","volume":"169","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC programming and DCA: thirty years of developments. Math. Program., Special Issue: DC Programming - Theory, Algorithms and Applications 169(1), 5\u201368 (2018)","journal-title":"Math. Program., Special Issue: DC Programming - Theory, Algorithms and Applications"},{"key":"487_CR26","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10898-008-9325-7","volume":"44","author":"HA Le Thi","year":"2009","unstructured":"Le Thi, H.A., Pham Dinh, T., Nguyen Canh, N., Nguyen, V.T.: DC programming techniques for solving a class of nonlinear bilevel programs. J. Glob. Optim. 44, 313\u2013337 (2009)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"487_CR27","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1007\/s10589-010-9388-5","volume":"51","author":"HA Le Thi","year":"2012","unstructured":"Le Thi, H.A., Moeini, M., Pham Dinh, T., J\u00fadice, J.J.: A DC programming approach for solving the symmetric eigenvalue complementarity problem. Comput. Optim. Appl. 51(3), 1097\u20131117 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"487_CR28","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s10898-011-9765-3","volume":"52","author":"HA Le Thi","year":"2012","unstructured":"Le Thi, H.A., Pham Dinh, T., Huynh, V.N.: Exact penalty and error bounds in DC programming. J. Glob. Optim. 52, 509\u2013535 (2012)","journal-title":"J. Glob. Optim."},{"key":"487_CR29","doi-asserted-by":"crossref","unstructured":"Le Thi, H.A., Huynh, V.N., Pham Dinh, T.: DC Programming and DCA for general DC Programs. In: Do van, T., Le Thi, H.A., Nguyen, N.T. (eds.) Advanced Computational Methods for Knowledge Engineering, Advances in Intelligent Systems and Computing, pp. 15\u201335. Springer, Cham (2014)","DOI":"10.1007\/978-3-319-06569-4_2"},{"issue":"1","key":"487_CR30","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10957-018-1345-y","volume":"179","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Huynh, V.N., Pham Dinh, T.: Convergence analysis of difference-of-convex algorithm with subanalytic data. J. Optim. Theory Appl. 179(1), 103\u2013126 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"487_CR31","doi-asserted-by":"crossref","first-page":"2263","DOI":"10.1137\/20M1385706","volume":"32","author":"HA Le Thi","year":"2022","unstructured":"Le Thi, H.A., Huynh, V.N., Pham Dinh, T., Luu, H.: Stochastic difference-of-convex functions algorithms for nonconvex programming. SIAM J. Optim. 32(3), 2263\u20132293 (2022)","journal-title":"SIAM J. Optim."},{"key":"487_CR32","unstructured":"Leyffer, S.: MacMPEC http:\/\/wiki.mcs.anl.gov\/leyffer\/index.php\/MacMPEC (webpage) (2000)"},{"issue":"1","key":"487_CR33","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/040621065","volume":"17","author":"S Leyffer","year":"2006","unstructured":"Leyffer, S., Lopez-Calva, G., Nocedal, J.: Interior methods for mathematical programs with complementarity constraints. SIAM J. Optim. 17(1), 52\u201377 (2006)","journal-title":"SIAM J. Optim."},{"key":"487_CR34","doi-asserted-by":"crossref","first-page":"5900","DOI":"10.1016\/j.amc.2011.11.046","volume":"218","author":"Y Li","year":"2012","unstructured":"Li, Y., Tan, T., Li, X.: A log-exponential smoothing method for mathematical programs with complementarity constraints. Appl. Math. Comput. 218, 5900\u20135909 (2012)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"487_CR35","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1024787424532","volume":"118","author":"GH Lin","year":"2003","unstructured":"Lin, G.H., Fukushima, M.: Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 118(1), 67\u201380 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"487_CR36","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10479-004-5024-z","volume":"133","author":"GH Lin","year":"2005","unstructured":"Lin, G.H., Fukushima, M.: Modified relaxation scheme for mathematical programs with complementarity constraints. Ann. Oper. Res. 133, 63\u201384 (2005)","journal-title":"Ann. Oper. Res."},{"key":"487_CR37","first-page":"231","volume":"101","author":"X Liu","year":"2004","unstructured":"Liu, X., Sun, J.: Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints. Math. Program. 101, 231\u2013261 (2004)","journal-title":"Math. Program."},{"key":"487_CR38","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1007\/s10957-007-9265-2","volume":"135","author":"GS Liu","year":"2007","unstructured":"Liu, G.S., Ye, J.J.: Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 135, 623\u2013641 (2007)","journal-title":"J. Optim. Theory Appl."},{"key":"487_CR39","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0377-0427(02)00419-3","volume":"146","author":"GS Liu","year":"2002","unstructured":"Liu, G.S., Zhang, J.Z.: A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints. J. Comput. Appl. Math. 146, 77\u201387 (2002)","journal-title":"J. Comput. Appl. Math."},{"key":"487_CR40","volume-title":"Mathematical Programs with Equilibrium Constraints","author":"ZQ Luo","year":"1996","unstructured":"Luo, Z.Q., Pang, J.S., Raplp, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)"},{"key":"487_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/02331939708844347","volume":"42","author":"OL Mangasarian","year":"1997","unstructured":"Mangasarian, O.L., Pang, J.S.: Exact penalty for mathematical programs with linear complementarity constraints. Optimization 42, 1\u20138 (1997)","journal-title":"Optimization"},{"issue":"4","key":"487_CR43","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1080\/10556788.2011.645543","volume":"28","author":"YS Niu","year":"2013","unstructured":"Niu, Y.S., Pham Dinh, T., Le Thi, H.A., J\u00fadice, J.J.: Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem. Optim. Methods Softw. 28(4), 812\u2013829 (2013)","journal-title":"Optim. Methods Softw."},{"key":"487_CR42","doi-asserted-by":"crossref","unstructured":"Niu, Y.S., J\u00fadice, J., Le Thi, H.A., Pham Dinh, T.: Solving the quadratic eigenvalue complementarity problem by DC programming. In: Le Thi, H.A., Pham Dinh, T., Nguyen, N.T. (eds.) Modelling, Computation and Optimization in Information Systems and Management Sciences, Advances in Intelligent Systems and Computing, vol. 359, pp. 203\u2013214 (2015)","DOI":"10.1007\/978-3-319-18161-5_18"},{"key":"487_CR44","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1080\/10556780410001704911","volume":"19","author":"JS Pang","year":"2004","unstructured":"Pang, J.S., Leyffer, S.: On the global minimization of the value-at-risk. Optim. Methods Softw. 19, 611\u2013631 (2004)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"487_CR45","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to D.C. programming: theory, algorithms and applications. Acta Math. Vietnam 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam"},{"issue":"2","key":"487_CR46","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T Pham Dinh","year":"1998","unstructured":"Pham Dinh, T., Le Thi, H.A.: A DC Optimization algorithm for solving the trust region subproblem. SIAM J. Optim. 8(2), 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"487_CR47","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Transactions on Computational Collective Intelligence XIII","author":"T Pham Dinh","year":"2014","unstructured":"Pham Dinh, T., Le Thi, H.A.: Recent advances in DC programming and DCA. In: Nguyen, N.T., Le Thi, H.A. (eds.) Transactions on Computational Collective Intelligence XIII. Lecture Notes in Computer Science, vol. 8342, pp. 1\u201337. Springer, Berlin (2014)"},{"key":"487_CR48","unstructured":"Pieper, H.: Algorithms for mathematical programs with equilibrium constraints with applications to deregulated electricity market. Ph.D. thesis, Standford University (2001)"},{"key":"487_CR49","unstructured":"Raghunathan, A.U., Biegler, L.T.: Barrier methods for mathematical programs with complementarity constraints (MPCCs). Technical report, Carnegie Mellon University, Department of Chemical Engineering, Pittsburgh, PA (2002)"},{"issue":"1","key":"487_CR50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.25.1.1.15213","volume":"25","author":"H Scheel","year":"2000","unstructured":"Scheel, H., Scholtes, S.: Mathematical programs with complementarity constraints: stationary, optimality, and sensitivity. Math. Oper. Res. 25(1), 1\u201322 (2000)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"487_CR51","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1137\/S1052623499361233","volume":"11","author":"S Scholtes","year":"2001","unstructured":"Scholtes, S.: Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optim. 11(4), 918\u2013936 (2001)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"487_CR52","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/S0363012996306121","volume":"37","author":"S Scholtes","year":"1999","unstructured":"Scholtes, S., St\u00f6hr, M.: Exact penalization of mathematical programs with equilibrium constraints. SIAM J. Control. Optim. 37(2), 617\u2013652 (1999)","journal-title":"SIAM J. Control. Optim."},{"issue":"5","key":"487_CR53","doi-asserted-by":"crossref","first-page":"2504","DOI":"10.1137\/090748883","volume":"20","author":"S Steffensen","year":"2010","unstructured":"Steffensen, S., Ulbrich, M.: A new relaxation scheme for mathematical programs with equilibrium constraints. SIAM J. Optim. 20(5), 2504\u20132539 (2010)","journal-title":"SIAM J. Optim."},{"key":"487_CR54","unstructured":"Yu, B.: A branch and cut approach to linear programs with linear complementarity constraints. Ph.D. thesis, Rensselaer Polytechnic Institute (2011)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00487-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00487-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00487-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T21:32:01Z","timestamp":1702330321000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00487-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,2]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["487"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00487-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,2]]},"assertion":[{"value":"25 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 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":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}