{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:10:03Z","timestamp":1766067003529,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T00:00:00Z","timestamp":1555718400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T00:00:00Z","timestamp":1555718400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Mega grant","award":["14.756.31.0001"],"award-info":[{"award-number":["14.756.31.0001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00521-019-04191-z","type":"journal-article","created":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T14:02:37Z","timestamp":1555768957000},"page":"7097-7120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Quadratic programming over ellipsoids with applications to constrained linear regression and tensor decomposition"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5509-7773","authenticated-orcid":false,"given":"Anh-Huy","family":"Phan","sequence":"first","affiliation":[]},{"given":"Masao","family":"Yamagishi","sequence":"additional","affiliation":[]},{"given":"Danilo","family":"Mandic","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"Cichocki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,20]]},"reference":[{"key":"4191_CR1","first-page":"2773","volume":"15","author":"A Anandkumar","year":"2014","unstructured":"Anandkumar A, Ge R, Hsu D, Kakade S, Telgarsky M (2014) Tensor decompositions for learning latent variable models. J Mach Learn Res 15:2773\u20132832","journal-title":"J Mach Learn Res"},{"unstructured":"ApS M (2015) The MOSEK optimization toolbox for MATLAB manual. Version 7.1 (Revision 28). \nhttp:\/\/docs.mosek.com\/7.1\/toolbox\/index.html","key":"4191_CR2"},{"issue":"4","key":"4191_CR3","doi-asserted-by":"publisher","first-page":"2320","DOI":"10.1137\/120890636","volume":"23","author":"N Arima","year":"2013","unstructured":"Arima N, Kim S, Kojima M (2013) A quadratically constrained quadratic optimization model for completely positive cone programming. SIAM J Optim 23(4):2320\u20132340. \nhttps:\/\/doi.org\/10.1137\/120890636","journal-title":"SIAM J Optim"},{"issue":"1","key":"4191_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10107-011-0462-2","volume":"129","author":"X Bao","year":"2011","unstructured":"Bao X, Sahinidis NV, Tawarmalani M (2011) Semidefinite relaxations for quadratically constrained quadratic programming: a review and comparisons. Math Program 129(1):129. \nhttps:\/\/doi.org\/10.1007\/s10107-011-0462-2","journal-title":"Math Program"},{"issue":"2","key":"4191_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/nav.3800190204","volume":"19","author":"DP Baron","year":"1972","unstructured":"Baron DP (1972) Quadratic programming with quadratic constraints. Naval Res Logist Q 19(2):253\u2013260","journal-title":"Naval Res Logist Q"},{"issue":"8","key":"4191_CR6","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1007\/s00521-015-2031-8","volume":"27","author":"X Ben","year":"2016","unstructured":"Ben X, Zhang P, Yan R, Yang M, Ge G (2016) Gait recognition and micro-expression recognition based on maximum margin projection with tensor representation. Neural Comput Appl 27(8):2629\u20132646. \nhttps:\/\/doi.org\/10.1007\/s00521-015-2031-8","journal-title":"Neural Comput Appl"},{"issue":"1","key":"4191_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF02592331","volume":"72","author":"A Ben-Tal","year":"1996","unstructured":"Ben-Tal A, Teboulle M (1996) Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math Program 72(1):51\u201363. \nhttps:\/\/doi.org\/10.1007\/BF02592331","journal-title":"Math Program"},{"issue":"2","key":"4191_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1145\/1149283.1149286","volume":"2","author":"P Biswas","year":"2006","unstructured":"Biswas P, Lian TC, Wang TC, Ye Y (2006) Semidefinite programming based algorithms for sensor network localization. ACM Trans Sen Netw 2(2):188\u2013220. \nhttps:\/\/doi.org\/10.1145\/1149283.1149286","journal-title":"ACM Trans Sen Netw"},{"issue":"3","key":"4191_CR9","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/TCNS.2015.2401172","volume":"2","author":"S Bose","year":"2015","unstructured":"Bose S, Gayme DF, Chandy KM, Low SH (2015) Quadratically constrained quadratic programs on acyclic graphs with application to power flow. IEEE Trans Control Netw Syst 2(3):278\u2013287. \nhttps:\/\/doi.org\/10.1109\/TCNS.2015.2401172","journal-title":"IEEE Trans Control Netw Syst"},{"key":"4191_CR10","first-page":"1455","volume":"15","author":"N Boumal","year":"2014","unstructured":"Boumal N, Mishra B, Absil PA, Sepulchre R (2014) Manopt, a Matlab toolbox for optimization on manifolds. J Mach Learn Res 15:1455\u20131459","journal-title":"J Mach Learn Res"},{"doi-asserted-by":"crossref","unstructured":"Boyd S, El Ghaoui L, Feron E, Balakrishnan V (1994) Linear matrix inequalities in system and control theory. Studies in applied mathematics, vol 15. SIAM, Philadelphia","key":"4191_CR11","DOI":"10.1137\/1.9781611970777"},{"issue":"1","key":"4191_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10589-013-9618-8","volume":"59","author":"S Burer","year":"2014","unstructured":"Burer S, Kim S, Kojima M (2014) Faster, but weaker, relaxations for quadratically constrained quadratic programs. Comput Optim Appl 59(1):27\u201345. \nhttps:\/\/doi.org\/10.1007\/s10589-013-9618-8","journal-title":"Comput Optim Appl"},{"unstructured":"Cardoso JF (1991) Super-symmetric decomposition of the fourth-order cumulant tensor. blind identification of more sources than sensors. In: Proceedings of the IEEE international conference on acoustics, speech, and signal processing (ICASSP91), Toronto, vol\u00a05, pp 3109\u20133112","key":"4191_CR13"},{"unstructured":"Chen Y, Gao DY (2013) Global solutions to large-scale spherical constrained quadratic minimization via canonical dual approach. ArXiv e-prints \narXiv:1308.4450v1","key":"4191_CR14"},{"issue":"11","key":"4191_CR15","doi-asserted-by":"publisher","first-page":"5698","DOI":"10.1109\/TSP.2012.2208956","volume":"60","author":"ALF de Almeida","year":"2012","unstructured":"de Almeida ALF, Luciani X, Stegeman A, Comon P (2012) CONFAC decomposition approach to blind identification of underdetermined mixtures based on generating function derivatives. IEEE Trans Signal Process 60(11):5698\u20135713","journal-title":"IEEE Trans Signal Process"},{"issue":"11","key":"4191_CR16","doi-asserted-by":"publisher","first-page":"3119","DOI":"10.1007\/s00521-016-2245-4","volume":"28","author":"S Ding","year":"2017","unstructured":"Ding S, Zhang N, Zhang X, Wu F (2017) Twin support vector machine: theory, algorithm and applications. Neural Comput Appl 28(11):3119\u20133130. \nhttps:\/\/doi.org\/10.1007\/s00521-016-2245-4","journal-title":"Neural Comput Appl"},{"key":"4191_CR17","volume-title":"Optimal quadratic programming algorithms: with applications to variational inequalities","author":"Z Dost\u00e1l","year":"2009","unstructured":"Dost\u00e1l Z (2009) Optimal quadratic programming algorithms: with applications to variational inequalities, 1st edn. Springer, New York","edition":"1"},{"issue":"1","key":"4191_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10107-011-0454-2","volume":"135","author":"Z Dost\u00e1l","year":"2012","unstructured":"Dost\u00e1l Z, Kozubek T (2012) An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications. Math Program 135(1):195\u2013220. \nhttps:\/\/doi.org\/10.1007\/s10107-011-0454-2","journal-title":"Math Program"},{"key":"4191_CR19","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1016\/0024-3795(89)90494-1","volume":"114","author":"W Gander","year":"1989","unstructured":"Gander W, Golub GH, von Matt U (1989) A constrained eigenvalue problem. Special Issue Dedicated to Alan J. Hoffman, Linear Algebra Appl 114:815\u2013839. \nhttps:\/\/doi.org\/10.1016\/0024-3795(89)90494-1","journal-title":"Special Issue Dedicated to Alan J. Hoffman, Linear Algebra Appl"},{"unstructured":"Gentile C, Li S, Kar P, Karatzoglou A, Zappella G, Etrue E (2017) On context-dependent clustering of bandits. In: Precup D, Teh YW (eds) Proceedings of the 34th international conference on machine learning, proceedings of machine learning research. PMLR, International Convention Centre, Sydney, vol\u00a070, pp 1253\u20131262","key":"4191_CR20"},{"issue":"3","key":"4191_CR21","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/MSP.2010.936015","volume":"27","author":"AB Gershman","year":"2010","unstructured":"Gershman AB, Sidiropoulos ND, Shahbazpanahi S, Bengtsson M, Ottersten B (2010) Convex optimization-based beamforming. IEEE Signal Process Mag 27(3):62\u201375. \nhttps:\/\/doi.org\/10.1109\/MSP.2010.936015","journal-title":"IEEE Signal Process Mag"},{"issue":"6","key":"4191_CR22","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42(6):1115\u20131145. \nhttps:\/\/doi.org\/10.1145\/227683.227684","journal-title":"J ACM"},{"issue":"1","key":"4191_CR23","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/S1052623499356071","volume":"12","author":"WW Hager","year":"2001","unstructured":"Hager WW (2001) Minimizing a quadratic over a sphere. SIAM J Optim 12(1):188\u2013208. \nhttps:\/\/doi.org\/10.1137\/S1052623499356071","journal-title":"SIAM J Optim"},{"unstructured":"Holmstr\u00f6m K (1997) TOMLAB\u2014an environment for solving optimization problems in MATLAB. In: Proceedings for the Nordic Matlab conference \u201997, pp 27\u201328","key":"4191_CR24"},{"doi-asserted-by":"publisher","unstructured":"Kar P, Li S, Narasimhan H, Chawla S, Sebastiani F (2016) Online optimization methods for the quantification problem. In: Proceedings of the 22 ACM SIGKDD international conference on knowledge discovery and data mining, KDD\u201916. New York, pp 1625\u20131634. \nhttps:\/\/doi.org\/10.1145\/2939672.2939832","key":"4191_CR25","DOI":"10.1145\/2939672.2939832"},{"key":"4191_CR26","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1080\/10556780108805819","volume":"15","author":"S Kim","year":"2000","unstructured":"Kim S, Kojima M (2000) Second order cone programming relaxation of nonconvex quadratic optimization problems. Optim Methods Softw 15:201\u2013224","journal-title":"Optim Methods Softw"},{"issue":"2","key":"4191_CR27","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1025794313696","volume":"26","author":"S Kim","year":"2003","unstructured":"Kim S, Kojima M (2003) Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations. Comput Optim Appl 26(2):143\u2013154. \nhttps:\/\/doi.org\/10.1023\/A:1025794313696","journal-title":"Comput Optim Appl"},{"unstructured":"Korda N, Sz\u00f6r\u00e9nyi B, Li S (2016) Distributed clustering of linear bandits in peer to peer networks. In: Proceedings of the 33nd international conference on machine learning, ICML 2016, pp 1301\u20131309","key":"4191_CR28"},{"unstructured":"Li S (2016) The art of clustering bandits. PhD thesis, Universit\u00e1 degli Studi dell\u2018Insubria","key":"4191_CR29"},{"doi-asserted-by":"publisher","unstructured":"Li S, Karatzoglou A, Gentile C (2016) Collaborative filtering bandits. In: Proceedings of the 39th international ACM SIGIR conference on research and development in information retrieval, SIGIR\u201916. ACM, New York, pp 539\u2013548 \nhttps:\/\/doi.org\/10.1145\/2911451.2911548","key":"4191_CR30","DOI":"10.1145\/2911451.2911548"},{"issue":"2","key":"4191_CR31","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1109\/TIT.2013.2291876","volume":"60","author":"L Lim","year":"2014","unstructured":"Lim L, Comon P (2014) Blind multilinear identification. IEEE Trans Inf Theory 60(2):1260\u20131280. \nhttps:\/\/doi.org\/10.1109\/TIT.2013.2291876","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"4191_CR32","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10107-005-0582-7","volume":"103","author":"J Linderoth","year":"2005","unstructured":"Linderoth J (2005) A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math Program 103(2):251\u2013282. \nhttps:\/\/doi.org\/10.1007\/s10107-005-0582-7","journal-title":"Math Program"},{"issue":"2","key":"4191_CR33","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.orl.2014.12.002","volume":"43","author":"M Locatelli","year":"2015","unstructured":"Locatelli M (2015) Some results for quadratic problems with one or two quadratic constraints. Oper Res Lett 43(2):126\u2013131. \nhttps:\/\/doi.org\/10.1016\/j.orl.2014.12.002","journal-title":"Oper Res Lett"},{"issue":"3","key":"4191_CR34","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/MSP.2010.936019","volume":"27","author":"Z Luo","year":"2010","unstructured":"Luo Z, Ma W, So AM, Ye Y, Zhang S (2010) Semidefinite relaxation of quadratic optimization problems. IEEE Signal Process Mag 27(3):20\u201334. \nhttps:\/\/doi.org\/10.1109\/MSP.2010.936019","journal-title":"IEEE Signal Process Mag"},{"key":"4191_CR35","first-page":"1147","volume":"7","author":"D Muti","year":"2005","unstructured":"Muti D, Bourennane S (2005) Multiway filtering based on fourth order cumulants. Appl Signal Proc EURASIP 7:1147\u20131159","journal-title":"Appl Signal Proc EURASIP"},{"key":"4191_CR36","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-1-4615-4381-7_13","volume-title":"International Series in Operations Research & Management Science","author":"Yuri Nesterov","year":"2000","unstructured":"Nesterov Y, Wolkowicz H, Ye Y (2000) Semidefinite programming relaxations of nonconvex quadratic optimization. Springer, New York, pp 361\u2013419. \nhttps:\/\/doi.org\/10.1007\/978-1-4615-4381-7_13"},{"issue":"2","key":"4191_CR37","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10208-015-9291-7","volume":"17","author":"J Nie","year":"2017","unstructured":"Nie J (2017) Generating polynomials and symmetric tensor decompositions. Found Comput Math 17(2):423\u2013465. \nhttps:\/\/doi.org\/10.1007\/s10208-015-9291-7","journal-title":"Found Comput Math"},{"issue":"1","key":"4191_CR38","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1587\/nolta.1.37","volume":"1","author":"AH Phan","year":"2010","unstructured":"Phan AH, Cichocki A (2010) Tensor decompositions for feature extraction and classification of high dimensional datasets. Nonlinear Theory Appl IEICE 1(1):37\u201368","journal-title":"Nonlinear Theory Appl IEICE"},{"issue":"5","key":"4191_CR39","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1109\/TSP.2018.2887192","volume":"67","author":"AH Phan","year":"2019","unstructured":"Phan AH, Tichavsk\u00fd P, Cichocki A (2019) Error preserving correction: a method for CP decomposition at a target error bound. IEEE Trans Signal Process 67(5):1175\u20131190. \nhttps:\/\/doi.org\/10.1109\/TSP.2018.2887192","journal-title":"IEEE Trans Signal Process"},{"doi-asserted-by":"publisher","unstructured":"Phan AH, Yamagishi M, Cichocki A (2017) An augmented Lagrangian algorithm for decomposition of symmetric tensors of order-4. In: 2017 IEEE international conference on acoustics, speech and signal processing (ICASSP), pp 2547\u20132551. \nhttps:\/\/doi.org\/10.1109\/ICASSP.2017.7952616","key":"4191_CR40","DOI":"10.1109\/ICASSP.2017.7952616"},{"key":"4191_CR41","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/B978-0-12-396501-1.00006-6","volume-title":"Academic Press Library in Signal Processing: Volume 4 - Image, Video Processing and Analysis, Hardware, Audio, Acoustic and Speech Processing","author":"Stanley J. Reeves","year":"2014","unstructured":"Reeves SJ (2014) Chapter 6 - image restoration: Fundamentals of image restoration. In: Trussell J, Srivastava A, Roy-Chowdhury AK, Srivastava A, Naylor PA, Chellappa R, Theodoridis S (eds) Academic press library in signal processing, vol 4. Elsevier, Amsterdam, pp 165\u2013192. \nhttps:\/\/doi.org\/10.1016\/B978-0-12-396501-1.00006-6"},{"key":"4191_CR42","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF02614438","volume":"77","author":"F Rendl","year":"1997","unstructured":"Rendl F, Wolkowicz H (1997) A semidefinite framework for trust region subproblems with applications to large scale minimization. Math Program 77:273\u2013299. \nhttps:\/\/doi.org\/10.1007\/BF02614438","journal-title":"Math Program"},{"issue":"2","key":"4191_CR43","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/1326548.1326553","volume":"34","author":"M Rojas","year":"2008","unstructured":"Rojas M, Santos SA, Sorensen DC (2008) Algorithm 873: LSTRS: Matlab software for large-scale trust-region subproblems and regularization. ACM Trans Math Softw 34(2):11:1\u201311:28. \nhttps:\/\/doi.org\/10.1145\/1326548.1326553","journal-title":"ACM Trans Math Softw"},{"key":"4191_CR44","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/11744085_46","volume-title":"Computer Vision \u2013 ECCV 2006","author":"Amnon Shashua","year":"2006","unstructured":"Shashua A, Zass R, Hazan T (2006) Multi-way clustering using super-symmetric non-negative tensor factorization. In: European conference on computer vision (ECCV), Graz. \nhttp:\/\/www.cs.huji.ac.il\/~zass\/"},{"issue":"1","key":"4191_CR45","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1137\/S1052623494274374","volume":"7","author":"DC Sorensen","year":"1997","unstructured":"Sorensen DC (1997) Minimization of a large-scale quadratic function subject to a spherical constraint. SIAM J Optim 7(1):141\u2013161. \nhttps:\/\/doi.org\/10.1137\/S1052623494274374","journal-title":"SIAM J Optim"},{"issue":"1\u20132","key":"4191_CR46","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10107-013-0738-9","volume":"149","author":"I Waldspurger","year":"2015","unstructured":"Waldspurger I, d\u2019Aspremont A, Mallat S (2015) Phase recovery, maxcut and complex semidefinite programming. Math Program 149(1\u20132):47\u201381. \nhttps:\/\/doi.org\/10.1007\/s10107-013-0738-9","journal-title":"Math Program"},{"key":"4191_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0584-1","author":"Z Wen","year":"2012","unstructured":"Wen Z, Yin W (2012) A feasible method for optimization with orthogonality constraints. Math Program. \nhttps:\/\/doi.org\/10.1007\/s10107-012-0584-1","journal-title":"Math Program"},{"issue":"2\u20133","key":"4191_CR48","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/(SICI)1099-1115(199603)10:2\/3<239::AID-ACS349>3.0.CO;2-C","volume":"10","author":"N Yuen","year":"1996","unstructured":"Yuen N, Friedlander B (1996) Asymptotic performance analysis of blind signal copy using fourth order cumulant. Int J Adapt Control Signal Process 10(2\u20133):239\u2013265","journal-title":"Int J Adapt Control Signal Process"},{"issue":"4","key":"4191_CR49","doi-asserted-by":"publisher","first-page":"1584","DOI":"10.1137\/080720863","volume":"31","author":"LH Zhang","year":"2010","unstructured":"Zhang LH, Liao LZ, Ng MK (2010) Fast algorithms for the generalized Foley\u2013Sammon discriminant analysis. SIAM J Matrix Anal Appl 31(4):1584\u20131605. \nhttps:\/\/doi.org\/10.1137\/080720863","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"2","key":"4191_CR50","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00521-015-2052-3","volume":"28","author":"Y Zhu","year":"2017","unstructured":"Zhu Y, Xue J (2017) Face recognition based on random subspace method and tensor subspace analysis. Neural Comput Appl 28(2):233\u2013244. \nhttps:\/\/doi.org\/10.1007\/s00521-015-2052-3","journal-title":"Neural Comput Appl"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04191-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-019-04191-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04191-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T13:18:48Z","timestamp":1590758328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-019-04191-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,20]]},"references-count":50,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["4191"],"URL":"https:\/\/doi.org\/10.1007\/s00521-019-04191-z","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2019,4,20]]},"assertion":[{"value":"17 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}