{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T07:00:31Z","timestamp":1704870031978},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T00:00:00Z","timestamp":1630281600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T00:00:00Z","timestamp":1630281600000},"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":[[2021,11]]},"DOI":"10.1007\/s10589-021-00311-5","type":"journal-article","created":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T17:02:55Z","timestamp":1630342975000},"page":"439-481","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On solving a class of fractional semi-infinite polynomial programming problems"],"prefix":"10.1007","volume":"80","author":[{"given":"Feng","family":"Guo","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0105-7749","authenticated-orcid":false,"given":"Liguo","family":"Jiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,30]]},"reference":[{"issue":"1","key":"311_CR1","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10107-011-0499-2","volume":"137","author":"AA Ahmadi","year":"2013","unstructured":"Ahmadi, A.A., Olshevsky, A., Parrilo, P.A., Tsitsiklis, J.N.: NP-hardness of deciding convexity of quartic polynomials and related problems. Math. Program. 137(1), 453\u2013476 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"311_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":"311_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":"311_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9174-4","volume-title":"Linear-Fractional Programming: Theory, Methods, Applications and Software","author":"EB Bajalinov","year":"2003","unstructured":"Bajalinov, E.B.: Linear-Fractional Programming: Theory, Methods, Applications and Software. Springer, Berlin (2003)"},{"key":"311_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-34514-5","volume-title":"Measure Theory","author":"VI Bogachev","year":"2007","unstructured":"Bogachev, V.I.: Measure Theory, vol. II. Springer, Berlin (2007)"},{"key":"311_CR6","volume-title":"Multiobjective Decision Making: Theory and Methodology","author":"V Chankong","year":"1983","unstructured":"Chankong, V., Haimes, Y.Y.: Multiobjective Decision Making: Theory and Methodology. North-Holland, Amsterdam (1983)"},{"issue":"2","key":"311_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/mnsc.9.2.209","volume":"9","author":"A Charnes","year":"1963","unstructured":"Charnes, A., Cooper, W.W., Kortanek, K.: Duality in semi-infinite programs and some works of Haar and Carath\u00e9odory. Manage. Sci. 9(2), 209\u2013228 (1963)","journal-title":"Manage. Sci."},{"issue":"2","key":"311_CR8","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.orl.2016.02.003","volume":"44","author":"TD Chuong","year":"2016","unstructured":"Chuong, T.D.: Nondifferentiable fractional semi-infinite multiobjective optimization problems. Oper. Res. Lett. 44(2), 260\u2013266 (2016)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"311_CR9","first-page":"189","volume":"54","author":"RE Curto","year":"2005","unstructured":"Curto, R.E., Fialkow, L.A.: Truncated $$K$$-moment problems in several variables. J. Op. Theory 54(1), 189\u2013226 (2005)","journal-title":"J. Op. Theory"},{"key":"311_CR10","volume-title":"Optimality Conditions in Convex Optimization: A Finite-Dimensional View","author":"A Dhara","year":"2012","unstructured":"Dhara, A., Dutta, J.: Optimality Conditions in Convex Optimization: A Finite-Dimensional View. CRC Press, Boca Raton (2012)"},{"key":"311_CR11","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Berlin (2005)","edition":"2"},{"issue":"4","key":"311_CR12","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1137\/060657741","volume":"18","author":"CA Floudas","year":"2007","unstructured":"Floudas, C.A., Stein, O.: The adaptive convexification algorithm: a feasible point method for semi-infinite programming. SIAM J. Optim. 18(4), 1187\u20131208 (2007)","journal-title":"SIAM J. Optim."},{"key":"311_CR13","volume-title":"Linear Semi-infinite Optimization","author":"M\u00c1 Goberna","year":"1998","unstructured":"Goberna, M.\u00c1., L\u00f3pez, M.A.: Linear Semi-infinite Optimization. John Wiley & Sons, Chichester (1998)"},{"issue":"3","key":"311_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10288-017-0350-6","volume":"15","author":"MA Goberna","year":"2017","unstructured":"Goberna, M.A., L\u00f3pez, M.A.: Recent contributions to linear semi-infinite optimization. 4OR 15(3), 221\u2013264 (2017)","journal-title":"4OR"},{"issue":"1","key":"311_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10479-018-2987-8","volume":"271","author":"MA Goberna","year":"2018","unstructured":"Goberna, M.A., L\u00f3pez, M.A.: Recent contributions to linear semi-infinite optimization: an update. Ann. Oper. Res. 271(1), 237\u2013278 (2018)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"311_CR16","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s10589-020-00168-0","volume":"75","author":"F Guo","year":"2020","unstructured":"Guo, F., Sun, X.: On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems. Comput. Optim. Appl. 75(3), 669\u2013699 (2020)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"311_CR17","first-page":"296","volume":"1","author":"Y Haimes","year":"1971","unstructured":"Haimes, Y., Lasdon, L., Wismer, D.: On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans. Syst. Man Cybern. 1(3), 296\u2013297 (1971)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"1","key":"311_CR18","doi-asserted-by":"publisher","first-page":"164","DOI":"10.2307\/2371063","volume":"58","author":"EK Haviland","year":"1936","unstructured":"Haviland, E.K.: On the momentum problem for distribution functions in more than one dimension. II. Am. J. Math. 58(1), 164\u2013168 (1936)","journal-title":"Am. J. Math."},{"issue":"1","key":"311_CR19","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10107-008-0240-y","volume":"122","author":"J Helton","year":"2010","unstructured":"Helton, J., Nie, J.: Semidefinite representation of convex sets. Math. Program. 122(1), 21\u201364 (2010)","journal-title":"Math. Program."},{"key":"311_CR20","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/10997703_15","volume-title":"Positive Polynomials in Control","author":"D Henrion","year":"2005","unstructured":"Henrion, D., Lasserre, J.B.: Detecting global optimality and extracting solutions in GloptiPoly. In: Henrion, D., Garulli, A. (eds.) Positive Polynomials in Control, pp. 293\u2013310. Springer, Berlin, Heidelberg (2005)"},{"issue":"4\u20135","key":"311_CR21","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1080\/10556780802699201","volume":"24","author":"D Henrion","year":"2009","unstructured":"Henrion, D., Lasserre, J.B., L\u00f6fberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Opt. Methods Softw. 24(4\u20135), 761\u2013779 (2009)","journal-title":"Opt. Methods Softw."},{"issue":"3","key":"311_CR22","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1137\/1035089","volume":"35","author":"R Hettich","year":"1993","unstructured":"Hettich, R., Kortanek, K.O.: Semi-infinite programming: theory, methods, and applications. SIAM Rev. 35(3), 380\u2013429 (1993)","journal-title":"SIAM Rev."},{"issue":"6","key":"311_CR23","doi-asserted-by":"publisher","first-page":"3384","DOI":"10.1137\/100791841","volume":"20","author":"V Jeyakumar","year":"2010","unstructured":"Jeyakumar, V., Li, G.Y.: Strong duality in robust convex programming: complete characterizations. SIAM J. Optim. 20(6), 3384\u20133407 (2010)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"311_CR24","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.orl.2012.09.006","volume":"40","author":"V Jeyakumar","year":"2012","unstructured":"Jeyakumar, V., Li, G.Y.: Exact SDP relaxations for classes of nonlinear semidefinite programming problems. Oper. Res. Lett. 40(6), 529\u2013536 (2012)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"311_CR25","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.orl.2013.11.005","volume":"42","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar, V., Pham, T.S., Li, G.Y.: Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness. Oper. Res. Lett. 42(1), 34\u201340 (2014)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"311_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s11590-015-0868-5","volume":"10","author":"C Josz","year":"2016","unstructured":"Josz, C., Henrion, D.: Strong duality in Lasserre\u2019s hierarchy for polynomial optimization. Opt. Lett. 10(1), 3\u201310 (2016)","journal-title":"Opt. Lett."},{"issue":"3","key":"311_CR27","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"311_CR28","doi-asserted-by":"publisher","first-page":"1995","DOI":"10.1137\/080728214","volume":"19","author":"JB Lasserre","year":"2009","unstructured":"Lasserre, J.B.: Convexity in semialgebraic geometry and polynomial optimization. SIAM J. Optim. 19(4), 1995\u20132014 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"311_CR29","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s11750-011-0172-1","volume":"20","author":"JB Lasserre","year":"2012","unstructured":"Lasserre, J.B.: An algorithm for semi-infinite polynomial optimization. TOP 20(1), 119\u2013129 (2012)","journal-title":"TOP"},{"issue":"1","key":"311_CR30","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s00209-006-0061-8","volume":"256","author":"JB Lasserre","year":"2007","unstructured":"Lasserre, J.B., Netzer, T.: SOS approximations of nonnegative polynomials via simple high degree perturbations. Math. Z. 256(1), 99\u2013112 (2007)","journal-title":"Math. Z."},{"key":"311_CR31","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-0-387-09686-5_7","volume-title":"Emerging Applications of Algebraic Geometry","author":"M Laurent","year":"2009","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, pp. 157\u2013270. Springer, New York, NY (2009)"},{"issue":"2","key":"311_CR32","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/s10957-018-1222-8","volume":"176","author":"JH Lee","year":"2018","unstructured":"Lee, J.H., Jiao, L.G.: Solving fractional multicriteria optimization problems with sum of squares convex polynomial data. J. Optim. Theory Appl. 176(2), 428\u2013455 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"311_CR33","doi-asserted-by":"publisher","first-page":"1489","DOI":"10.1137\/080716803","volume":"19","author":"GY Li","year":"2008","unstructured":"Li, G.Y., Ng, K.F.: On extension of Fenchel duality and its application. SIAM J. Optim. 19(3), 1489\u20131509 (2008)","journal-title":"SIAM J. Optim."},{"key":"311_CR34","unstructured":"L\u00f6fberg, J.: YALMIP : a toolbox for modeling and optimization in MATLAB. In 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508), pages 284\u2013289, (2004)"},{"issue":"2","key":"311_CR35","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.ejor.2006.08.045","volume":"180","author":"M L\u00f3pez","year":"2007","unstructured":"L\u00f3pez, M., Still, G.: Semi-infinite programming. Eur. J. Oper. Res. 180(2), 491\u2013518 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"311_CR36","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1080\/10556788.2015.1029575","volume":"31","author":"V-B Nguyen","year":"2016","unstructured":"Nguyen, V.-B., Sheu, R.-L., Xia, Y.: An SDP approach for quadratic fractional problems with a two-sided quadratic constraint. Opt. Methods Softw. 31(4), 701\u2013719 (2016)","journal-title":"Opt. Methods Softw."},{"issue":"1\u20132","key":"311_CR37","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10107-012-0589-9","volume":"142","author":"J Nie","year":"2013","unstructured":"Nie, J.: Certifying convergence of Lasserre\u2019s hierarchy via flat truncation. Math. Program. Ser. A 142(1\u20132), 485\u2013510 (2013)","journal-title":"Math. Program. Ser. A"},{"issue":"1\u20132","key":"311_CR38","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10107-013-0680-x","volume":"146","author":"J Nie","year":"2014","unstructured":"Nie, J.: Optimality conditions and finite convergence of Lasserre\u2019s hierarchy. Math. Program. Ser. A 146(1\u20132), 97\u2013121 (2014)","journal-title":"Math. Program. Ser. A"},{"issue":"1","key":"311_CR39","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.jco.2006.07.002","volume":"23","author":"J Nie","year":"2007","unstructured":"Nie, J., Schweighofer, M.: On the complexity of Putinar\u2019s positivstellensatz. J. Complex. 23(1), 135\u2013150 (2007)","journal-title":"J. Complex."},{"issue":"2","key":"311_CR40","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10957-008-9473-4","volume":"141","author":"P Parpas","year":"2009","unstructured":"Parpas, P., Rustem, B.: An algorithm for the global optimization of a class of continuous minimax problems. J. Optim. Theory Appl. 141(2), 461\u2013473 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"10","key":"311_CR41","doi-asserted-by":"publisher","first-page":"4677","DOI":"10.1090\/S0002-9947-00-02595-2","volume":"352","author":"V Powers","year":"2000","unstructured":"Powers, V., Reznick, B.: Polynomials that are positive on an interval. Trans. Am. Math. Soc. 352(10), 4677\u20134692 (2000)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"311_CR42","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M Putinar","year":"1993","unstructured":"Putinar, M.: Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42(3), 969\u2013984 (1993)","journal-title":"Indiana Univ. Math. J."},{"key":"311_CR43","doi-asserted-by":"crossref","unstructured":"Reznick, B.: Some concrete aspects of Hilbert\u2019s 17th problem. In Contemporary Mathematics, volume 253, pages 251\u2013272. American Mathematical Society, (2000)","DOI":"10.1090\/conm\/253\/03936"},{"issue":"2","key":"311_CR44","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/1055678031000105242","volume":"18","author":"S Schaible","year":"2003","unstructured":"Schaible, S., Shi, J.M.: Fractional programming: the sum-of-ratios case. Opt. Methods Softw. 18(2), 219\u2013229 (2003)","journal-title":"Opt. Methods Softw."},{"issue":"4","key":"311_CR45","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s00209-003-0568-1","volume":"245","author":"C Scheiderer","year":"2003","unstructured":"Scheiderer, C.: Sums of squares on real algebraic curves. Math. Z. 245(4), 725\u2013760 (2003)","journal-title":"Math. Z."},{"issue":"1","key":"311_CR46","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF01446568","volume":"289","author":"K Schm\u00fcdgen","year":"1991","unstructured":"Schm\u00fcdgen, K.: The k-moment problem for compact semi-algebraic sets. Math. Ann. 289(1), 203\u2013206 (1991)","journal-title":"Math. Ann."},{"issue":"2","key":"311_CR47","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1080\/02331930902730070","volume":"58","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A.: Semi-infinite programming, duality, discretization and optimality conditions. Optimzation 58(2), 133\u2013161 (2009)","journal-title":"Optimzation"},{"key":"311_CR48","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-1-4615-4381-7_4","volume-title":"Handbook of Semidefinite Programming - Theory. Algorithms, and Applications","author":"A Shapiro","year":"2000","unstructured":"Shapiro, A., Scheinber, K.: Duality, optimality conditions and perturbation analysis. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Handbook of Semidefinite Programming - Theory. Algorithms, and Applications, pp. 67\u2013110. Kluwer Academic Publisher, Boston (2000)"},{"key":"311_CR49","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-0035-6","volume-title":"Fractional Programming: Theory. Methods and Applications","author":"IM Stancu-Minasian","year":"1997","unstructured":"Stancu-Minasian, I.M.: Fractional Programming: Theory. Methods and Applications. Springer, Netherlands (1997)"},{"issue":"1","key":"311_CR50","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10107-012-0556-5","volume":"136","author":"O Stein","year":"2012","unstructured":"Stein, O., Steuermann, P.: The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets. Math. Program. 136(1), 183\u2013207 (2012)","journal-title":"Math. Program."},{"issue":"1\u20134","key":"311_CR51","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Opt. Methods Softw. 11(1\u20134), 625\u2013653 (1999)","journal-title":"Opt. Methods Softw."},{"key":"311_CR52","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-6256-8","volume-title":"Semi-Infinite Fractional Programming","author":"RU Verma","year":"2017","unstructured":"Verma, R.U.: Semi-Infinite Fractional Programming. Infosys Science Foundation Series, Springer Singapore (2017)"},{"issue":"1","key":"311_CR53","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10589-013-9612-1","volume":"58","author":"L Wang","year":"2013","unstructured":"Wang, L., Guo, F.: Semidefinite relaxations for semi-infinite polynomial programming. Comput. Optim. Appl. 58(1), 133\u2013159 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"311_CR54","first-page":"603","volume":"64","author":"Y Xu","year":"2015","unstructured":"Xu, Y., Sun, W., Qi, L.: On solving a class of linear semi-infinite programming by SDP method. Optimization 64(3), 603\u2013616 (2015)","journal-title":"Optimization"},{"issue":"2","key":"311_CR55","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1515\/jaa.2010.014","volume":"16","author":"G Zalmai","year":"2010","unstructured":"Zalmai, G., Zhang, Q.: Semiinfinite multiobjective fractional programming, Part I: sufficient efficiency conditions. J. Appl. Anal. 16(2), 199\u2013224 (2010)","journal-title":"J. Appl. Anal."},{"issue":"1","key":"311_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jaa.2011.001","volume":"17","author":"G Zalmai","year":"2011","unstructured":"Zalmai, G., Zhang, Q.: Semiinfinite multiobjective fractional programming, Part II: duality models. J. Appl. Anal. 17(1), 1\u201335 (2011)","journal-title":"J. Appl. Anal."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00311-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00311-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00311-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T02:21:33Z","timestamp":1675650093000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00311-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,30]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["311"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00311-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,30]]},"assertion":[{"value":"28 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}