{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T08:01:49Z","timestamp":1761897709826,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T00:00:00Z","timestamp":1663372800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T00:00:00Z","timestamp":1663372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Hungarian Research Fund","award":["NKFIH 125700"],"award-info":[{"award-number":["NKFIH 125700"]}]},{"name":"Babes-Bolyai University","award":["AGC32879\/18.06.2021"],"award-info":[{"award-number":["AGC32879\/18.06.2021"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We propose a new predictor\u2013corrector interior-point algorithm for solving Cartesian symmetric cone horizontal linear complementarity problems, which is not based on a usual barrier function. We generalize the predictor\u2013corrector algorithm introduced in Darvay et al. (SIAM J Optim 30:2628\u20132658, 2020) to horizontal linear complementarity problems on a Cartesian product of symmetric cones. We apply the algebraically equivalent transformation technique proposed by Darvay (Adv Model Optim 5:51\u201392, 2003), and we use the difference of the identity and the square root function to determine the new search directions.  In each iteration, the proposed algorithm performs one predictor and one corrector step. We prove that the predictor\u2013corrector interior-point algorithm has the same complexity bound as the best known interior-point methods for solving these types of problems. Furthermore, we provide a condition related to the proximity and update parameters for which the introduced predictor-corrector algorithm is well defined.<\/jats:p>","DOI":"10.1007\/s10957-022-02078-z","type":"journal-article","created":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T06:02:36Z","timestamp":1663394556000},"page":"50-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New Predictor\u2013Corrector Algorithm for Symmetric Cone Horizontal Linear Complementarity Problems"],"prefix":"10.1007","volume":"202","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1094-9837","authenticated-orcid":false,"given":"Zsolt","family":"Darvay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3867-0304","authenticated-orcid":false,"given":"Petra Ren\u00e1ta","family":"Rig\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,17]]},"reference":[{"key":"2078_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1590\/S0101-82052006000100005","volume":"25","author":"M Achache","year":"2006","unstructured":"Achache, M.: A new primal-dual path-following method for convex quadratic programming. Comput. Appl. Math. 25, 97\u2013110 (2006)","journal-title":"Comput. Appl. Math."},{"key":"2078_CR2","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1734803","author":"S Asadi","year":"2020","unstructured":"Asadi, S., Mahdavi-Amiri, N., Darvay, Z., Rig\u00f3, P.R.: Full-NT step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function. Optim. Methods Sofw. (2020). https:\/\/doi.org\/10.1080\/10556788.2020.1734803","journal-title":"Optim. Methods Sofw."},{"key":"2078_CR3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1080\/02331934.2016.1267732","volume":"66","author":"S Asadi","year":"2017","unstructured":"Asadi, S., Mansouri, H., Darvay, Z.: An infeasible full-NT step IPM for $$P_*(\\kappa )$$ horizontal linear complementarity problem over Cartesian product of symmetric cones. Optimization 66, 225\u2013250 (2017)","journal-title":"Optimization"},{"key":"2078_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1080\/10556788.2015.1058795","volume":"31","author":"S Asadi","year":"2016","unstructured":"Asadi, S., Mansouri, H., Darvay, Z., Zangiabadi, M.: On the $$P_*(\\kappa )$$ horizontal linear complementarity problems over Cartesian product of symmetric cones. Optim. Methods Softw. 31, 233\u2013257 (2016)","journal-title":"Optim. Methods Softw."},{"key":"2078_CR5","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1080\/01630563.2016.1232731","volume":"38","author":"S Asadi","year":"2017","unstructured":"Asadi, S., Zangiabadi, M., Mansouri, H.: A predictor-corrector interior-point algorithm for $$P_*(\\kappa )$$-HLCPs over Cartesian product of symmetric cones. Numer. Funct. Anal. Optim. 38, 20\u201338 (2017)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"2078_CR6","doi-asserted-by":"crossref","first-page":"2031","DOI":"10.1080\/02331934.2018.1512604","volume":"67","author":"S Asadi","year":"2018","unstructured":"Asadi, S., Mansouri, H., Lesaja, G., Zangiabadi, M.: A long-step interior-point algorithm for symmetric cone Cartesian $$P_*(\\kappa )$$-HLCP. Optimization 67, 2031\u20132060 (2018)","journal-title":"Optimization"},{"key":"2078_CR7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1137\/S1052623403423114","volume":"15","author":"YQ Bai","year":"2004","unstructured":"Bai, Y.Q., El Ghami, M., Roos, C.: A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM J. Optim. 15, 101\u2013128 (2004)","journal-title":"SIAM J. Optim."},{"key":"2078_CR8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF00940344","volume":"60","author":"S-J Chung","year":"1989","unstructured":"Chung, S.-J.: NP-completeness of the linear complementarity problem. J. Optim. Theory Appl. 60, 393\u2013399 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"2078_CR9","first-page":"51","volume":"5","author":"Z Darvay","year":"2003","unstructured":"Darvay, Z.: New interior-point algorithms in linear programming. Adv. Model. Optim. 5, 51\u201392 (2003)","journal-title":"Adv. Model. Optim."},{"key":"2078_CR10","first-page":"135","volume":"22","author":"Z Darvay","year":"2005","unstructured":"Darvay, Z.: A new predictor\u2013corrector algorithm for linear programming. Alk. Mat. Lapok 22, 135\u2013161 (2005). (in Hungarian)","journal-title":"Alk. Mat. Lapok"},{"key":"2078_CR11","first-page":"121","volume":"54","author":"Z Darvay","year":"2009","unstructured":"Darvay, Z.: A predictor\u2013corrector algorithm for linearly constrained convex optimization. Stud. Univ. Babe\u015f-Bolyai Ser. Inform. 54, 121\u2013138 (2009)","journal-title":"Stud. Univ. Babe\u015f-Bolyai Ser. Inform."},{"key":"2078_CR12","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s11590-020-01612-0","volume":"15","author":"Z Darvay","year":"2021","unstructured":"Darvay, Z., Ill\u00e9s, T., Majoros, C.: Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation. Optim. Lett. 15, 357\u2013376 (2021)","journal-title":"Optim. Lett."},{"key":"2078_CR13","doi-asserted-by":"crossref","first-page":"2628","DOI":"10.1137\/19M1248972","volume":"30","author":"Z Darvay","year":"2020","unstructured":"Darvay, Z., Ill\u00e9s, T., Povh, J., Rig\u00f3, P.R.: Predictor\u2013corrector interior-point algorithm for sufficient linear complementarity problems based on a new search direction. SIAM J. Optim. 30, 2628\u20132658 (2020)","journal-title":"SIAM J. Optim."},{"key":"2078_CR14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10998-016-0119-2","volume":"73","author":"Z Darvay","year":"2016","unstructured":"Darvay, Z., Papp, I.-M., Tak\u00e1cs, P.-R.: Complexity analysis of a full-Newton step interior-point method for linear optimization. Period. Math. Hung. 73, 27\u201342 (2016)","journal-title":"Period. Math. Hung."},{"key":"2078_CR15","doi-asserted-by":"crossref","first-page":"1705","DOI":"10.1080\/01630563.2018.1492938","volume":"39","author":"Z Darvay","year":"2018","unstructured":"Darvay, Z., Rig\u00f3, P.R.: New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function. Numer. Funct. Anal. Optim. 39, 1705\u20131726 (2018)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"2078_CR16","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0167-6377(97)00011-4","volume":"20","author":"E de Klerk","year":"1997","unstructured":"de Klerk, E., Roos, C., Terlaky, T.: Initialization in semidefinite programming via a self-dual skew-symmetric embedding. Oper. Res. Lett. 20, 213\u2013221 (1997)","journal-title":"Oper. Res. Lett."},{"key":"2078_CR17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-1-4615-4381-7_5","volume-title":"Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, International Series in Operations Research & Management Science","author":"E de Klerk","year":"2000","unstructured":"de Klerk, E., Roos, C., Terlaky, T.: Self-dual embeddings. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, International Series in Operations Research & Management Science, vol. 27, pp. 111\u2013138. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"2078_CR18","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on Symmetric Cones, Oxford Mathematical Monographs","author":"J Faraut","year":"1994","unstructured":"Faraut, J., Kor\u00e1nyi, A.: Analysis on Symmetric Cones, Oxford Mathematical Monographs. The Clarendon Press, New York (1994)"},{"key":"2078_CR19","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0377-0427(97)00153-2","volume":"86","author":"L Faybusovich","year":"1997","unstructured":"Faybusovich, L.: Linear systems in Jordan algebras and primal-dual interior-point algorithms. J. Comput. Appl. Math. 86, 149\u2013175 (1997)","journal-title":"J. Comput. Appl. Math."},{"key":"2078_CR20","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/moor.21.4.860","volume":"21","author":"O G\u00fcler","year":"1996","unstructured":"G\u00fcler, O.: Barrier functions in interior point methods. Math. Oper. Res. 21, 860\u2013885 (1996)","journal-title":"Math. Oper. Res."},{"key":"2078_CR21","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10898-008-9348-0","volume":"47","author":"T Ill\u00e9s","year":"2010","unstructured":"Ill\u00e9s, T., Nagy, M., Terlaky, T.: A polynomial path-following interior point algorithm for general linear complementarity problems. J. Glob. Optim. 47, 329\u2013342 (2010)","journal-title":"J. Glob. Optim."},{"key":"2078_CR22","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/j.ejor.2005.08.031","volume":"181","author":"T Ill\u00e9s","year":"2007","unstructured":"Ill\u00e9s, T., Nagy, M.: A Mizuno\u2013Todd\u2013Ye type predictor\u2013corrector algorithm for sufficient linear complementarity problems. Eur. J. Oper. Res. 181, 1097\u20131111 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"2078_CR23","first-page":"1","volume":"5","author":"T Ill\u00e9s","year":"2010","unstructured":"Ill\u00e9s, T., Nagy, M., Terlaky, T.: Polynomial interior point algorithms for general linear complementarity problems. Alg. Oper. Res. 5, 1\u201312 (2010)","journal-title":"Alg. Oper. Res."},{"key":"2078_CR24","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10898-008-9348-0","volume":"47","author":"T Ill\u00e9s","year":"2010","unstructured":"Ill\u00e9s, T., Nagy, M., Terlaky, T.: A polynomial path-following interior point algorithm for general linear complementarity problems. J. Glob. Optim. 47, 329\u2013342 (2010)","journal-title":"J. Glob. Optim."},{"key":"2078_CR25","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1051\/ro\/2016020","volume":"51","author":"M Karimi","year":"2017","unstructured":"Karimi, M., Luo, S., Tun\u00e7el, L.: Primal-dual entropy-based interior-point algorithms for linear optimization. RAIRO-Oper. Res. 51, 299\u2013328 (2017)","journal-title":"RAIRO-Oper. Res."},{"key":"2078_CR26","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"NK Karmarkar","year":"1984","unstructured":"Karmarkar, N.K.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"2078_CR27","doi-asserted-by":"crossref","first-page":"277","DOI":"10.17535\/crorr.2016.0019","volume":"7","author":"B Kheirfam","year":"2016","unstructured":"Kheirfam, B., Haghighi, M.: A full-Newton step feasible interior-point algorithm for $${P}_{*}(\\kappa )$$-LCP based on a new search direction. Croat. Oper. Res. Rev. 7, 277\u2013290 (2016)","journal-title":"Croat. Oper. Res. Rev."},{"key":"2078_CR28","doi-asserted-by":"crossref","unstructured":"Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A unified approach to interior point algorithms for linear complementarity problems. In: Lecture Notes in Computer Science, vol. 538. Springer, New York (1991)","DOI":"10.1007\/3-540-54509-3"},{"key":"2078_CR29","first-page":"2994","volume":"21","author":"G Lesaja","year":"2011","unstructured":"Lesaja, G., Roos, C.: Unified analysis of kernel-based interior-point methods for $$P_*(\\kappa )$$-LCP. SIAM J. Optim. 21, 2994\u20133013 (2011)","journal-title":"SIAM J. Optim."},{"key":"2078_CR30","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1080\/10556788.2012.670858","volume":"27","author":"G Lesaja","year":"2012","unstructured":"Lesaja, G., Wang, G.Q., Zhu, D.T.: Interior-point methods for Cartesian $$P_*(\\kappa )$$-linear complementarity problems over symmetric cones based on the eligible kernel functions. Optim. Methods Softw. 27, 827\u2013843 (2012)","journal-title":"Optim. Methods Softw."},{"key":"2078_CR31","first-page":"1769","volume":"52","author":"ZQ Luo","year":"2009","unstructured":"Luo, Z.Q., Xiu, N.: Path-following interior point algorithms for the Cartesian $$P_{*}(\\kappa )$$-LCP over symmetric cones. Sci. China Ser. A Math. 52, 1769\u20131784 (2009)","journal-title":"Sci. China Ser. A Math."},{"key":"2078_CR32","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1080\/10556780008805800","volume":"14","author":"ZQ Luo","year":"2000","unstructured":"Luo, Z.Q., Sturm, J.F., Zhang, S.: Conic convex programming and self-dual embedding. Optim. Methods Softw. 14, 169\u2013218 (2000)","journal-title":"Optim. Methods Softw."},{"key":"2078_CR33","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1080\/02331934.2015.1062011","volume":"65","author":"N Mohammadi","year":"2015","unstructured":"Mohammadi, N., Mansouri, H., Zangiabadi, M., Asadi, S.: A full Nesterov\u2013Todd step infeasible-interior-point algorithm for Cartesian $$P_*(\\kappa )$$ horizontal linear complementarity problem over symmetric cones. Optimization 65, 539\u2013565 (2015)","journal-title":"Optimization"},{"key":"2078_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"YE Nesterov","year":"1997","unstructured":"Nesterov, Y.E., Todd, M.J.: Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22, 1\u201342 (1997)","journal-title":"Math. Oper. Res."},{"key":"2078_CR35","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"YE Nesterov","year":"1998","unstructured":"Nesterov, Y.E., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8, 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"key":"2078_CR36","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/j.jmaa.2005.04.028","volume":"314","author":"S Pan","year":"2006","unstructured":"Pan, S., Li, X., He, S.: An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation. J. Math. Anal. Appl. 314, 644\u2013660 (2006)","journal-title":"J. Math. Anal. Appl."},{"key":"2078_CR37","volume-title":"Self-Regularity, A New Paradigm for Primal-Dual Interior-Point Algorithms","author":"J Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: Self-Regularity, A New Paradigm for Primal-Dual Interior-Point Algorithms. Princeton University Press, Princeton (2002)"},{"key":"2078_CR38","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1137\/15M1049415","volume":"27","author":"F Permenter","year":"2017","unstructured":"Permenter, F., Friberg, H.A., Andersen, E.D.: Solving conic optimization problems via self-dual embedding and facial reduction: a unified approach. SIAM J. Optim. 27, 1257\u20131282 (2017)","journal-title":"SIAM J. Optim."},{"key":"2078_CR39","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1080\/10556789808805691","volume":"9","author":"FA Potra","year":"1998","unstructured":"Potra, F.A., Sheng, R.: On homogeneous interior-point algorithms for semidefinite programming. Optim. Methods Softw. 9, 161\u2013184 (1998)","journal-title":"Optim. Methods Softw."},{"key":"2078_CR40","unstructured":"Rig\u00f3, P.R.: New trends in algebraic equivalent transformation of the central path and its applications. Ph.D. thesis, Budapest University of Technology and Economics, Institute of Mathematics, Hungary (2020)"},{"key":"2078_CR41","unstructured":"Rig\u00f3, P.R.: New trends in interior-point algorithms. In: Friedler, F. (ed.) Proceeding of the 8th VOCAL Optimization Conference: Advanced Algorithms (short papers), pp. 85\u201390. Hungary, Esztergom (2018)"},{"key":"2078_CR42","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10589-018-0012-4","volume":"71","author":"PR Rig\u00f3","year":"2018","unstructured":"Rig\u00f3, P.R., Darvay, Z.: Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier. Comput. Optim. Appl. 71, 483\u2013508 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"2078_CR43","volume-title":"Theory and Algorithms for Linear Optimization","author":"C Roos","year":"2005","unstructured":"Roos, C., Terlaky, T., Vial, J.P.: Theory and Algorithms for Linear Optimization. Springer, New York (2005)"},{"key":"2078_CR44","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10107-003-0380-z","volume":"96","author":"SH Schmieta","year":"2003","unstructured":"Schmieta, S.H., Alizadeh, F.: Extension of primal-dual interior point algorithms to symmetric cones. Math. Program. 96, 409\u2013438 (2003)","journal-title":"Math. Program."},{"key":"2078_CR45","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0024-3795(00)00096-3","volume":"312","author":"JF Sturm","year":"2000","unstructured":"Sturm, J.F.: Similarity and other spectral relations for symmetric cones. Linear Algebra Appl. 312, 135\u2013154 (2000)","journal-title":"Linear Algebra Appl."},{"key":"2078_CR46","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1008637929927","volume":"8","author":"L Tun\u00e7el","year":"1997","unstructured":"Tun\u00e7el, L., Todd, M.J.: On the interplay among entropy, variable metrics and potential functions in interior-point algorithms. Comput. Optim. Appl. 8, 5\u201319 (1997)","journal-title":"Comput. Optim. Appl."},{"key":"2078_CR47","unstructured":"Vieira, M.V.C.: Jordan algebraic approach to symmetric optimization. Ph.D. thesis, Delft University of Technology, The Netherlands (2007)"},{"key":"2078_CR48","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1007\/s10957-012-0013-x","volume":"154","author":"GQ Wang","year":"2012","unstructured":"Wang, G.Q., Bai, Y.Q.: A new full Nesterov\u2013Todd step primal-dual path-following interior-point algorithm for symmetric optimization. J. Optim. Theory Appl. 154, 966\u2013985 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"2078_CR49","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"S Wright","year":"1997","unstructured":"Wright, S.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"key":"2078_CR50","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms, Theory and Analysis","author":"Y Ye","year":"1997","unstructured":"Ye, Y.: Interior Point Algorithms, Theory and Analysis. Wiley, Chichester (1997)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02078-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02078-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02078-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T08:02:55Z","timestamp":1721548975000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02078-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,17]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["2078"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02078-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2022,9,17]]},"assertion":[{"value":"29 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2022","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 conflicts of interest to declare that are relevant to the content of this article","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Data sharing is not applicable to this article as no datasets were generated or analysed during the current study.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Research Data Policy and Data Availability Statements"}}]}}