{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T16:38:19Z","timestamp":1774715899619,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T00:00:00Z","timestamp":1548720000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P1-0383"],"award-info":[{"award-number":["P1-0383"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["N1-0057"],"award-info":[{"award-number":["N1-0057"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["J1-8132"],"award-info":[{"award-number":["J1-8132"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["N1-0071"],"award-info":[{"award-number":["N1-0071"]}],"id":[{"id":"10.13039\/501100004329","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":[[2019,5]]},"DOI":"10.1007\/s10589-019-00066-0","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T05:56:03Z","timestamp":1548741363000},"page":"37-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A new approximation hierarchy for polynomial conic optimization"],"prefix":"10.1007","volume":"73","author":[{"given":"Peter J. C.","family":"Dickinson","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9856-1476","authenticated-orcid":false,"given":"Janez","family":"Povh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,29]]},"reference":[{"key":"66_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadi, A. A., Majumdar, A.: DSOS and SDSOS optimization: LP and SOCP-based alternatives to sum of squares optimization. In: 2014 48th Annual Conference on Information Sciences and Systems (CISS), IEEE, pp. 1\u20135. Princeton, NJ (2014)","DOI":"10.1109\/CISS.2014.6814141"},{"issue":"4","key":"66_CR2","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s11590-015-0894-3","volume":"10","author":"AA Ahmadi","year":"2016","unstructured":"Ahmadi, A.A., Majumdar, A.: Some applications of polynomial optimization in operations research and real-time decision making. Optim. Lett. 10(4), 709\u2013729 (2016)","journal-title":"Optim. Lett."},{"key":"66_CR3","doi-asserted-by":"crossref","unstructured":"Berman, A.: Cones, Matrices and Mathematical Programming. Lecture Notes in Economics and Mathematical Systems, vol. 79. Springer (1973)","DOI":"10.1007\/978-3-642-80730-5"},{"key":"66_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33338-0","volume-title":"Optimization of Polynomials in Non-commuting Variables","author":"S Burgdorf","year":"2016","unstructured":"Burgdorf, S., Klep, I., Povh, J.: Optimization of Polynomials in Non-commuting Variables. Springer, Berlin (2016)"},{"key":"66_CR5","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. Oper. Theory 54, 189\u2013226 (2005)","journal-title":"J. Oper. Theory"},{"issue":"1","key":"66_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.jpaa.2006.05.028","volume":"209","author":"J Demmel","year":"2007","unstructured":"Demmel, J., Nie, J., Powers, V.: Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals. J. Pure Appl. Algebra 209(1), 189\u2013200 (2007)","journal-title":"J. Pure Appl. Algebra"},{"key":"66_CR7","unstructured":"Dickinson, P.J.C.: The Copositive Cone, the Completely Positive Cone and their Generalisations. Ph.D. thesis, University of Groningen, Groningen, The Netherlands (2013)"},{"issue":"4","key":"66_CR8","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s10898-014-0196-9","volume":"61","author":"PJC Dickinson","year":"2015","unstructured":"Dickinson, P.J.C., Povh, J.: On an extension of P\u00f3lya\u2019s Positivstellensatz. J. Glob. Optim. 61(4), 615\u2013625 (2015)","journal-title":"J. Glob. Optim."},{"issue":"6","key":"66_CR9","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42(6), 1115\u20131145 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"key":"66_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/b96977","volume-title":"Positive Polynomials in Control","author":"D Henrion","year":"2005","unstructured":"Henrion, D., Garulli, A.: Positive Polynomials in Control, vol. 312. Springer, Berlin (2005)"},{"issue":"2","key":"66_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1145\/779359.779363","volume":"29","author":"D Henrion","year":"2003","unstructured":"Henrion, D., Lasserre, J.-B.: Gloptipoly: global optimization over polynomials with matlab and sedumi. ACM Trans. Math. Softw. 29(2), 165\u2013194 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"66_CR12","doi-asserted-by":"crossref","unstructured":"Henrion, D., Lasserre, J.-B.: Detecting Global Optimality and Extracting Solutions in GloptiPoly. Lecture Notes in Control and Information Science, vol. 312, pp. 293\u2013310. Springer, Berlin (2005)","DOI":"10.1007\/10997703_15"},{"issue":"2","key":"66_CR13","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TAC.2005.863494","volume":"51","author":"D Henrion","year":"2006","unstructured":"Henrion, D., Lasserre, J.-B.: Convergent relaxations of polynomial matrix inequalities and static output feedback. IEEE Trans. Autom. Control 51(2), 192\u2013202 (2006)","journal-title":"IEEE Trans. Autom. Control"},{"key":"66_CR14","unstructured":"Hol, C.W., Scherer, C.W.: Sum of squares relaxations for polynomial semidefinite programming. In: Proceedings of Symposium on Mathematical Theory of Networks and Systems (MTNS), Leuven, Belgium, (2004)"},{"key":"66_CR15","doi-asserted-by":"crossref","unstructured":"Hol, C.W.J., Scherer, C.W.: A sum-of-squares approach to fixed-order \n                    \n                      \n                    \n                    $$H_\\infty $$\n                    \n                      \n                        \n                          H\n                          \u221e\n                        \n                      \n                    \n                  -synthesis. In: Positive Polynomials in Control. Lecture Notes in Control and Information Science, vol. 312, pp. 45\u201371. Springer, Berlin (2005)","DOI":"10.1007\/10997703_3"},{"key":"66_CR16","unstructured":"Josz, C., Molzahn, D.K.: Moment\/sum-of-squares hierarchy for complex polynomial optimization (2015). arXiv preprint \n                    arXiv:1508.02068"},{"issue":"2","key":"66_CR17","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10898-015-0308-1","volume":"64","author":"I Klep","year":"2016","unstructured":"Klep, I., Povh, J.: Constrained trace-optimization of polynomials in freely noncommuting variables. J. Glob. Optim. 64(2), 325\u2013348 (2016)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"66_CR18","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1512\/iumj.2010.59.4107","volume":"59","author":"I Klep","year":"2010","unstructured":"Klep, I., Schweighofer, M.: Pure states, positive matrix polynomials and sums of hermitian squares. Indiana Univ. Math. J. 59(3), 857\u2013874 (2010)","journal-title":"Indiana Univ. Math. J."},{"key":"66_CR19","volume-title":"Sums of squares relaxations of polynomial semidefinite programs","author":"M Kojima","year":"2003","unstructured":"Kojima, M.: Sums of squares relaxations of polynomial semidefinite programs. Department of Mathematical and computing Sciences, Tokyo Institute of Technology, Meguro, Tokyo (2003)"},{"issue":"2","key":"66_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.15807\/jorsj.46.125","volume":"46","author":"M Kojima","year":"2003","unstructured":"Kojima, M., Kim, S., Waki, H.: A general framework for convex relaxation of polynomial optimization problems over cones. J. Oper. Res. Soc. Jpn. 46(2), 125\u2013144 (2003)","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"3","key":"66_CR21","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."},{"key":"66_CR22","volume-title":"Moments, Positive Polynomials and their Applications","author":"JB Lasserre","year":"2010","unstructured":"Lasserre, J.B.: Moments, Positive Polynomials and their Applications, vol. 1. Imperial College Press, London (2010). Imperial College Press Optimization Series"},{"issue":"3","key":"66_CR23","doi-asserted-by":"publisher","first-page":"1742","DOI":"10.1137\/130908841","volume":"23","author":"JB Lasserre","year":"2013","unstructured":"Lasserre, J.B.: A lagrangian relaxation view of linear and semidefinite hierarchies. SIAM J. Optim. 23(3), 1742\u20131756 (2013)","journal-title":"SIAM J. Optim."},{"key":"66_CR24","first-page":"1","volume":"5","author":"JB Lasserre","year":"2015","unstructured":"Lasserre, J.B., Toh, K.-C., Yang, S.: A bounded degree SOS hierarchy for polynomial optimization. EURO J. Comput. Optim. 5, 1\u201331 (2015)","journal-title":"EURO J. Comput. Optim."},{"issue":"1","key":"66_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-004-0561-4","volume":"109","author":"M Laurent","year":"2007","unstructured":"Laurent, M.: Semidefinite representations for finite varieties. Math. Program. 109(1), 1\u201326 (2007)","journal-title":"Math. Program."},{"key":"66_CR26","first-page":"157","volume-title":"Sums of Squares, Moment Matrices and Optimization Over Polynomials, The IMA Volumes in Mathematics and its Applications,","author":"M Laurent","year":"2009","unstructured":"Laurent, M.: Sums of Squares, Moment Matrices and Optimization Over Polynomials, The IMA Volumes in Mathematics and its Applications, vol. 149, pp. 157\u2013270. Springer, Berlin (2009)"},{"key":"66_CR27","volume-title":"Discrete Optimization, Handbooks in Operations Research and Management Science, vol 12, pp 393\u2013514","author":"M Laurent","year":"2005","unstructured":"Laurent, M., Rendl, F.: Semidefinite programming and integer programming. In: Aardal, G.N.K., Weismantel, R. (eds.) Discrete Optimization, Handbooks in Operations Research and Management Science, vol 12, pp 393\u2013514. Elsevier, New York (2005)"},{"key":"66_CR28","unstructured":"L\u00f6fberg, J.: YALMIP : A toolbox for modeling and optimization in matlab. In: In Proceedings of the CACSD Conference, Taipei, Taiwan (2004)"},{"key":"66_CR29","unstructured":"Matlab version (r2012a), : The MathWorks. Natick, MA, USA (2012)"},{"issue":"1","key":"66_CR30","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10479-017-2407-5","volume":"265","author":"A Marandi","year":"2018","unstructured":"Marandi, A., Dahl, J., de Klerk, E.: A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem. Ann. Oper. Res. 265(1), 67\u201392 (2018)","journal-title":"Ann. Oper. Res."},{"key":"66_CR31","unstructured":"MOSEK ApS. The MOSEK optimization toolbox for MATLAB manual. Version 7.1 (Revision 28) (2015)"},{"issue":"2","key":"66_CR32","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty, K.G., Kabadi, S.N.: Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39(2), 117\u2013129 (1987)","journal-title":"Math. Program."},{"issue":"12","key":"66_CR33","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. 142(12), 485\u2013510 (2013)","journal-title":"Math. Program."},{"issue":"12","key":"66_CR34","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-011-0489-4","volume":"137","author":"J Nie","year":"2013","unstructured":"Nie, J.: An exact jacobian SDP relaxation for polynomial optimization. Math. Program. 137(12), 225\u2013255 (2013)","journal-title":"Math. Program."},{"issue":"3","key":"66_CR35","doi-asserted-by":"publisher","first-page":"1634","DOI":"10.1137\/120898772","volume":"23","author":"J Nie","year":"2013","unstructured":"Nie, J.: Polynomial optimization with real varieties. SIAM J. Optim. 23(3), 1634\u20131646 (2013)","journal-title":"SIAM J. Optim."},{"issue":"12","key":"66_CR36","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. 146(12), 97\u2013121 (2014)","journal-title":"Math. Program."},{"issue":"3","key":"66_CR37","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s10107-005-0672-6","volume":"106","author":"J Nie","year":"2006","unstructured":"Nie, J., Demmel, J., Sturmfels, B.: Minimizing polynomials via sum of squares over the gradient ideal. Math. Program. 106(3), 587\u2013606 (2006)","journal-title":"Math. Program."},{"key":"66_CR38","unstructured":"Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. thesis, California Institute of Technology, Pasadena, California, (2000)"},{"issue":"1","key":"66_CR39","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1137\/05064401X","volume":"18","author":"J Pe\u00f1a","year":"2008","unstructured":"Pe\u00f1a, J., Vera, J., Zuluaga, L.F.: Computing the stability number of a graph via linear and semidefinite programming. SIAM J. Optim. 18(1), 87\u2013105 (2008)","journal-title":"SIAM J. Optim."},{"key":"66_CR40","first-page":"1","volume":"62","author":"J Povh","year":"2011","unstructured":"Povh, J.: Contribution of copositive formulations to the graph partitioning problem. Optim. A J. Math. Program. Oper. Res. 62, 1\u201313 (2011)","journal-title":"Optim. A J. Math. Program. Oper. Res."},{"issue":"1","key":"66_CR41","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/050637467","volume":"18","author":"J Povh","year":"2007","unstructured":"Povh, J., Rendl, F.: A copositive programming approach to graph partitioning. SIAM J. Optim. 18(1), 223\u2013241 (2007)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"66_CR42","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.disopt.2009.01.002","volume":"6","author":"J Povh","year":"2009","unstructured":"Povh, J., Rendl, F.: Copositive and semidefinite relaxations of the quadratic assignment problem. Discrete Optim. 6(3), 231\u2013241 (2009)","journal-title":"Discrete Optim."},{"issue":"3","key":"66_CR43","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."},{"issue":"7","key":"66_CR44","first-page":"585","volume":"328","author":"M Putinar","year":"1999","unstructured":"Putinar, M., Vasilescu, F.-H.: Positive polynomials on semi-algebraic sets. Compt. Rendus de l\u2019Acad\u00e9mie des Sci.\u2014Ser. I\u2014Math. 328(7), 585\u2013589 (1999)","journal-title":"Compt. Rendus de l\u2019Acad\u00e9mie des Sci.\u2014Ser. I\u2014Math."},{"issue":"2, Ser. A","key":"66_CR45","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121(2, Ser. A), 307\u2013335 (2010)","journal-title":"Math. Program."},{"issue":"3","key":"66_CR46","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: \n                    \n                      \n                    \n                    $$P$$\n                    \n                      \n                        P\n                      \n                    \n                  -complete approximation problems. J. Assoc. Comput. Mach. 23(3), 555\u2013565 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"2","key":"66_CR47","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF01446568","volume":"289","author":"K Schm\u00fcdgen","year":"1991","unstructured":"Schm\u00fcdgen, K.: The \n                    \n                      \n                    \n                    $$K$$\n                    \n                      \n                        K\n                      \n                    \n                  -moment problem for compact semi-algebraic sets. Math. Ann. 289(2), 203\u2013206 (1991)","journal-title":"Math. Ann."},{"key":"66_CR48","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1999","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Hoboken (1999)"},{"key":"66_CR49","volume-title":"Combinatorial Optimization","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Berlin (2003)"},{"issue":"3","key":"66_CR50","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1137\/S1052623403431779","volume":"15","author":"M Schweighofer","year":"2005","unstructured":"Schweighofer, M.: Optimization of polynomials on compact semialgebraic sets. SIAM J. Optim. 15(3), 805\u2013825 (2005)","journal-title":"SIAM J. Optim."},{"key":"66_CR51","unstructured":"Simionica, M., Povh, J.: A parallel implementation of the boundary point method. In: SOR \u201917 Proceedings, Bled, Slovenia, pp. 114\u2013119 (2017)"},{"key":"66_CR52","unstructured":"Sturm, J.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\u201312, 625\u2013653 (1999). Version 1.05 \n                    http:\/\/fewcal.kub.nl\/sturm"},{"key":"66_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-017-0121-6","volume":"10","author":"T Weisser","year":"2017","unstructured":"Weisser, T., Lasserre, J.-B., Toh, K.-C.: Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity. Math. Program. Comput. 10, 1\u201332 (2017)","journal-title":"Math. Program. Comput."},{"key":"66_CR54","unstructured":"Wolfram Research, Inc., Mathematica, Version 11.3, Champaign, IL (2018). \n                    http:\/\/support.wolfram.com\/kb\/472"},{"key":"66_CR55","volume-title":"Integer Programming. A Wiley-Interscience Publication","author":"L Wolsey","year":"1998","unstructured":"Wolsey, L.: Integer Programming. A Wiley-Interscience Publication. Wiley, Hoboken (1998)"},{"issue":"8","key":"66_CR56","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1016\/S0167-8191(03)00087-5","volume":"29","author":"M Yamashita","year":"2003","unstructured":"Yamashita, M., Fujisawa, K., Kojima, M.: SDPARA: semidefinite programming algorithm parallel version. Parallel Comput. 29(8), 1053\u20131067 (2003)","journal-title":"Parallel Comput."},{"issue":"4","key":"66_CR57","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"X-Y Zhao","year":"2010","unstructured":"Zhao, X.-Y., Sun, D., Toh, K.-C.: A newton-cg augmented lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00066-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00066-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00066-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T19:07:27Z","timestamp":1580238447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00066-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,29]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["66"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00066-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,29]]},"assertion":[{"value":"1 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}