{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,27]],"date-time":"2025-12-27T21:13:37Z","timestamp":1766870017553,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T00:00:00Z","timestamp":1712620800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T00:00:00Z","timestamp":1712620800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["11601327"],"award-info":[{"award-number":["11601327"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10957-024-02414-5","type":"journal-article","created":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T03:41:11Z","timestamp":1712634071000},"page":"720-759","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Programs"],"prefix":"10.1007","volume":"201","author":[{"given":"Hu","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9993-3681","authenticated-orcid":false,"given":"Yi-Shuai","family":"Niu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,9]]},"reference":[{"issue":"1","key":"2414_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-017-1144-5","volume":"169","author":"AA Ahmadi","year":"2018","unstructured":"Ahmadi, A.A., Hall, G.: DC decomposition of nonconvex polynomials with algebraic techniques. Math. Program. 169(1), 69\u201394 (2018)","journal-title":"Math. Program."},{"issue":"1","key":"2414_CR2","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10107-011-0457-z","volume":"135","author":"AA Ahmadi","year":"2012","unstructured":"Ahmadi, A.A., Parrilo, P.A.: A convex polynomial that is not SOS-convex. Math. Program. 135(1), 275\u2013292 (2012)","journal-title":"Math. Program."},{"issue":"2","key":"2414_CR3","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1137\/110856010","volume":"23","author":"AA Ahmadi","year":"2013","unstructured":"Ahmadi, A.A., Parrilo, P.A.: A complete characterization of the gap between convexity and SOS-convexity. SIAM J. Optim. 23(2), 811\u2013833 (2013)","journal-title":"SIAM J. Optim."},{"key":"2414_CR4","doi-asserted-by":"crossref","unstructured":"Anjos, M.F., Lasserre, J.B.: Handbook on semidefinite. In: Conic and Polynomial Optimization, vol. 166. Springer Science & Business Media (2011)","DOI":"10.1007\/978-1-4614-0769-0"},{"key":"2414_CR5","unstructured":"ApS, M.: Mosek optimization toolbox for MATLAB. In: User\u2019s Guide and Reference Manual, Version 4 (2019)"},{"issue":"1","key":"2414_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10107-017-1180-1","volume":"169","author":"FJA Artacho","year":"2018","unstructured":"Artacho, F.J.A., Fleming, R.M., Vuong, P.T.: Accelerating the DC algorithm for smooth functions. Math. Program. 169(1), 95\u2013118 (2018)","journal-title":"Math. Program."},{"issue":"1","key":"2414_CR7","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1137\/18M123339X","volume":"30","author":"FJA Artacho","year":"2020","unstructured":"Artacho, F.J.A., Vuong, P.T.: The boosted DC algorithm for non-smooth functions. SIAM J. Optim. 30(1), 980\u20131006 (2020)","journal-title":"SIAM J. Optim."},{"key":"2414_CR8","doi-asserted-by":"crossref","unstructured":"Athayde, G.M.D., Fl\u00f4res, R.G.: Incorporating skewness and kurtosis in portfolio optimization: a multidimensional efficient set. In: Advances in Portfolio Construction and Implementation, Quantitative Finance, pp. 243\u2013257. Elsevier (2003)","DOI":"10.1016\/B978-075065448-7.50011-2"},{"issue":"2","key":"2414_CR9","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1137\/S0895479893249757","volume":"16","author":"M Bakonyi","year":"1995","unstructured":"Bakonyi, M., Johnson, C.R.: The Euclidian distance matrix completion problem. SIAM J. Matrix Anal. Appl. 16(2), 646\u2013654 (1995)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2414_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, Philadelphia (2017)"},{"issue":"1","key":"2414_CR11","doi-asserted-by":"publisher","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(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"2414_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2013.10.007","volume":"42","author":"A Beck","year":"2014","unstructured":"Beck, A., Teboulle, M.: A fast dual proximal gradient algorithm for convex minimization and applications. Oper. Res. Lett. 42(1), 1\u20136 (2014)","journal-title":"Oper. Res. Lett."},{"key":"2414_CR13","doi-asserted-by":"crossref","unstructured":"Biosca, A.F.: Representation of a polynomial function as a difference of convex polynomials, with an application. In: Generalized Convexity and Generalized Monotonicity, Lecture Notes in Economics and Mathematical Systems, pp. 189\u2013207. Springer (2001)","DOI":"10.1007\/978-3-642-56645-5_13"},{"issue":"4","key":"2414_CR14","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2414_CR15","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/B:COAP.0000026886.61324.e4","volume":"28","author":"IM Bomze","year":"2004","unstructured":"Bomze, I.M., Locatelli, M.: Undominated DC decompositions of quadratic functions and applications to branch-and-bound approaches. Comput. Optim. Appl. 28(2), 227\u2013245 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"2414_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970777","volume-title":"Linear Matrix Inequalities in System and Control Theory","author":"S Boyd","year":"1994","unstructured":"Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory. SIAM, Philadelphia (1994)"},{"issue":"2","key":"2414_CR17","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10589-015-9772-2","volume":"63","author":"C Br\u00e1s","year":"2016","unstructured":"Br\u00e1s, C., Eichfelder, G., J\u00fadice, J.: Copositivity tests based on the linear complementarity problem. Comput. Optim. Appl. 63(2), 461\u2013493 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"2\u20133","key":"2414_CR18","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0165-1684(96)00079-5","volume":"53","author":"P Comon","year":"1996","unstructured":"Comon, P., Mourrain, B.: Decomposition of quantics in sums of powers of linear forms. Signal Process. 53(2\u20133), 93\u2013107 (1996)","journal-title":"Signal Process."},{"issue":"1","key":"2414_CR19","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1137\/16M1065264","volume":"27","author":"E De Klerk","year":"2017","unstructured":"De Klerk, E., Hess, R., Laurent, M.: Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization. SIAM J. Optim. 27(1), 347\u2013367 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2414_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10107-012-0625-9","volume":"140","author":"M D\u00fcr","year":"2013","unstructured":"D\u00fcr, M., Hiriart-Urruty, J.B.: Testing copositivity with the help of difference-of-convex optimization. Math. Program. 140(1), 31\u201343 (2013)","journal-title":"Math. Program."},{"key":"2414_CR21","unstructured":"Fletcher, R.: Filtersd-a Library for Nonlinear Optimization Written in Fortran (2015). https:\/\/projects.coin-or.org\/filterSD"},{"issue":"3","key":"2414_CR22","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1007\/s10957-014-0642-3","volume":"165","author":"P Frankel","year":"2015","unstructured":"Frankel, P., Garrigos, G., Peypouquet, J.: Splitting methods with variable metric for Kurdyka\u2013\u0141ojasiewicz functions and general convergence rates. J. Optim. Theory Appl. 165(3), 874\u2013900 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2414_CR23","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-017-1181-0","volume":"169","author":"J Gotoh","year":"2018","unstructured":"Gotoh, J., Takeda, A., Tono, K.: DC formulations and algorithms for sparse optimization problems. Math. Program. 169(1), 141\u2013176 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"2414_CR24","doi-asserted-by":"publisher","first-page":"707","DOI":"10.2140\/pjm.1959.9.707","volume":"9","author":"P Hartman","year":"1959","unstructured":"Hartman, P.: On functions representable as a difference of convex functions. Pac. J. Math. 9(3), 707\u2013713 (1959)","journal-title":"Pac. J. Math."},{"key":"2414_CR25","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.B.: Generalized differentiability, duality and optimization for problems dealing with differences of convex functions. In: Convexity and Duality in Optimization, Lecture Notes in Economics and Mathematical Systems, pp. 37\u201370. Springer (1985)","DOI":"10.1007\/978-3-642-45610-7_3"},{"issue":"2","key":"2414_CR26","first-page":"129","volume":"318","author":"K Kurdyka","year":"1994","unstructured":"Kurdyka, K., Parusinski, A.: wf-stratification of subanalytic functions and the \u0141ojasiewicz inequality. C. R. Acad Sci. Ser. I Math. 318(2), 129\u2013133 (1994)","journal-title":"C. R. Acad Sci. Ser. I Math."},{"issue":"3","key":"2414_CR27","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s101070050003","volume":"87","author":"HA Le Thi","year":"2000","unstructured":"Le Thi, H.A.: An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints. Math. Program. 87(3), 401\u2013426 (2000)","journal-title":"Math. Program."},{"issue":"3","key":"2414_CR28","doi-asserted-by":"publisher","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, D.T., Judice, 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."},{"issue":"3","key":"2414_CR29","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"HA Le Thi","year":"1997","unstructured":"Le Thi, H.A., Pham, D.T.: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J. Glob. Optim. 11(3), 253\u2013285 (1997)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"2414_CR30","first-page":"23","volume":"133","author":"HA Le Thi","year":"2005","unstructured":"Le Thi, H.A., Pham, D.T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133(1), 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"2414_CR31","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Pham, D.T.: DC programming and DCA: thirty years of developments. Math. Program. 169(1), 5\u201368 (2018)","journal-title":"Math. Program."},{"key":"2414_CR32","doi-asserted-by":"crossref","unstructured":"\u0141ojasiewicz, S.: Sur La G\u00e9om\u00e9trie Semi et Sous-analytique. In: Annales de l\u2019institut Fourier, pp. 1575\u20131595 (1993)","DOI":"10.5802\/aif.1384"},{"issue":"2","key":"2414_CR33","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10898-007-9224-3","volume":"43","author":"D Maringer","year":"2009","unstructured":"Maringer, D., Parpas, P.: Global optimization of higher order moments in portfolio selection. J. Glob. Optim. 43(2), 219\u2013230 (2009)","journal-title":"J. Glob. Optim."},{"key":"2414_CR34","unstructured":"Megretski, A.: SPOT: Systems Polynomial Optimization Tools (2013)"},{"issue":"3","key":"2414_CR35","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for solving the convex programming problem with convergence rate $$O(1\/k^{2})$$. Dokl. Akad. Nauk SSSR 269(3), 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"2414_CR36","unstructured":"Niu, Y.S., Le Thi, H.A., Pham, D.T.: On difference-of-sos and difference-of-convex-sos decompositions for polynomials (2018). arXiv:1803.09900"},{"issue":"2","key":"2414_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-022-01882-z","volume":"92","author":"YS Niu","year":"2022","unstructured":"Niu, Y.S., Glowinski, R.: Discrete dynamical system approaches for Boolean polynomial optimization. J. Sci. Comput. 92(2), 1\u201339 (2022)","journal-title":"J. Sci. Comput."},{"key":"2414_CR38","doi-asserted-by":"crossref","unstructured":"Niu, Y.S., J\u00fadice, J., Le\u00a0Thi, H.A., Pham, D.T.: Solving the quadratic eigenvalue complementarity problem by DC programming. In: Modelling, Computation and Optimization in Information Systems and Management Sciences, Advances in Intelligent Systems and Computing, pp. 203\u2013214. Springer (2015)","DOI":"10.1007\/978-3-319-18161-5_18"},{"key":"2414_CR39","first-page":"95","volume":"353","author":"YS Niu","year":"2019","unstructured":"Niu, Y.S., J\u00fadice, J., Le Thi, H.A., Pham, D.T.: Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem. Appl. Math. Comput. 353, 95\u2013113 (2019)","journal-title":"Appl. Math. Comput."},{"key":"2414_CR40","doi-asserted-by":"crossref","unstructured":"Niu, Y.S., Pham, D.T.: DC programming approaches for BMI and QMI feasibility problems. In: Advanced Computational Methods for Knowledge Engineering, Advances in Intelligent Systems and Computing, pp. 37\u201363. Springer (2014)","DOI":"10.1007\/978-3-319-06569-4_3"},{"issue":"4","key":"2414_CR41","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1080\/10556788.2011.645543","volume":"28","author":"YS Niu","year":"2013","unstructured":"Niu, Y.S., Pham, D.T., Le Thi, H.A., J\u00fadice, 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":"2414_CR42","unstructured":"Niu, Y.S., Wang, Y.J., Le\u00a0Thi, H.A., Pham, D.T.: Higher-order moment portfolio optimization via an accelerated difference-of-convex programming approach and sums-of-squares. arXiv:1906.01509 (2019)"},{"key":"2414_CR43","doi-asserted-by":"crossref","unstructured":"Niu, Y.S., Zhang, H.: Power-product matrix: nonsingularity, sparsity and determinant. Linear Multilinear Algebra 1\u201318 (2023)","DOI":"10.1080\/03081087.2023.2173133"},{"issue":"4","key":"2414_CR44","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/s11228-018-0497-0","volume":"27","author":"W de Oliveira","year":"2019","unstructured":"de Oliveira, W., Tcheou, M.P.: An inertial algorithm for dc programming. Set-Valued Var. Anal. 27(4), 895\u2013919 (2019)","journal-title":"Set-Valued Var. Anal."},{"key":"2414_CR45","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971163","volume-title":"The Symmetric Eigenvalue Problem","author":"BN Parlett","year":"1998","unstructured":"Parlett, B.N.: The Symmetric Eigenvalue Problem. SIAM, Philadelphia (1998)"},{"issue":"1","key":"2414_CR46","first-page":"289","volume":"22","author":"DT Pham","year":"1997","unstructured":"Pham, D.T., Le Thi, H.A.: Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math. Vietnam 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam"},{"issue":"2","key":"2414_CR47","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"DT Pham","year":"1998","unstructured":"Pham, D.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."},{"issue":"2","key":"2414_CR48","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s11590-015-0931-2","volume":"10","author":"DT Pham","year":"2016","unstructured":"Pham, D.T., Le Thi, H.A., Pham, V.N., Niu, Y.S.: DC programming approaches for discrete portfolio optimization under concave transaction costs. Optim. Lett. 10(2), 261\u2013282 (2016)","journal-title":"Optim. Lett."},{"issue":"3","key":"2414_CR49","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10589-010-9383-x","volume":"50","author":"DT Pham","year":"2011","unstructured":"Pham, D.T., Niu, Y.S.: An efficient DC programming approach for portfolio decision with higher moments. Comput. Optim. Appl. 50(3), 525\u2013554 (2011)","journal-title":"Comput. Optim. Appl."},{"key":"2414_CR50","doi-asserted-by":"crossref","unstructured":"Pham, D.T., Souad, E.B.: Duality in DC (difference of convex functions) optimization. subgradient methods. In: Trends in Mathematical Optimization: 4th French-German Conference on Optimization, International Series of Numerical Mathematics, pp. 277\u2013293. Springer (1988)","DOI":"10.1007\/978-3-0348-9297-1_18"},{"key":"2414_CR51","doi-asserted-by":"crossref","unstructured":"Phan, D.N., Le, H.M., Le\u00a0Thi, H.A.: Accelerated difference of convex functions algorithm and its application to sparse binary logistic regression. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence, pp. 1369\u20131375 (2018)","DOI":"10.24963\/ijcai.2018\/190"},{"issue":"5","key":"2414_CR52","doi-asserted-by":"publisher","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(5), 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"2414_CR53","doi-asserted-by":"crossref","unstructured":"Reznick, B.A.: Sum of Even Powers of Real Linear Forms. American Mathematical Society (1992)","DOI":"10.1090\/memo\/0463"},{"issue":"1","key":"2414_CR54","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10957-016-0907-0","volume":"170","author":"Y Song","year":"2016","unstructured":"Song, Y., Yu, G.: Properties of solution set of tensor complementarity problem. J. Optim. Theory Appl. 170(1), 85\u201396 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2414_CR55","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10589-017-9954-1","volume":"69","author":"B Wen","year":"2018","unstructured":"Wen, B., Chen, X., Pong, T.K.: A proximal difference-of-convex algorithm with extrapolation. Comput. Optim. Appl. 69(2), 297\u2013324 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2414_CR56","first-page":"65","volume":"24","author":"Y You","year":"2023","unstructured":"You, Y., Niu, Y.S.: A refined inertial dc algorithm for dc programming. Optim. Eng. 24(1), 65\u201391 (2023)","journal-title":"Optim. Eng."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02414-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02414-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02414-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T15:14:38Z","timestamp":1715267678000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02414-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,9]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["2414"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02414-5","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2024,4,9]]},"assertion":[{"value":"10 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2024","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"}}]}}