{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:55Z","timestamp":1740142495360,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T00:00:00Z","timestamp":1623974400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T00:00:00Z","timestamp":1623974400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771210","12001281"],"award-info":[{"award-number":["11771210","12001281"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Suqian Sci&Tech Program","award":["Z2020135","Z2019110"],"award-info":[{"award-number":["Z2020135","Z2019110"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s40314-021-01554-y","type":"journal-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T08:03:30Z","timestamp":1624003410000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6649-1103","authenticated-orcid":false,"given":"Xin","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Qin","family":"Ni","sequence":"additional","affiliation":[]},{"given":"Zhou","family":"Sheng","sequence":"additional","affiliation":[]},{"given":"Zhili","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"1554_CR1","unstructured":"Bader BW, Kolda TG (2018) MATLAB Tensor Toolbox, Version 3.0. https:\/\/www.tensortoolbox.org"},{"key":"1554_CR2","unstructured":"Bang-Jensen J, Gutin G (2006) Digraphs: Theory, Algorithms and Applications. Springer Monographs in Mathematics, 2nd edn. Springer, London"},{"key":"1554_CR3","volume-title":"Graphs and Hypergraphs","author":"C Berge","year":"1973","unstructured":"Berge C (1973) Graphs and Hypergraphs. North-Holland Mathematical Library, NorthHolland"},{"key":"1554_CR4","doi-asserted-by":"publisher","unstructured":"Bretto A (2013) Hypergraph Theory: An Introduction. Springer, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-319-00080-0","DOI":"10.1007\/978-3-319-00080-0"},{"key":"1554_CR5","doi-asserted-by":"publisher","unstructured":"Bul\u00f2 SR, Pelillo M (2009) New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory. In: International Conference on Learning and Intelligent Optimization, Springer, Heidelberg. 45\u201358. https:\/\/doi.org\/10.1007\/978-3-642-11169-3_4","DOI":"10.1007\/978-3-642-11169-3_4"},{"issue":"6","key":"1554_CR6","doi-asserted-by":"publisher","first-page":"A3618","DOI":"10.1137\/16M1060224","volume":"38","author":"JY Chang","year":"2016","unstructured":"Chang JY, Chen YN, Qi LQ (2016) Computing eigenvalues of large scale sparse tensors arising from a hypergraph. SIAM J Sci Comput 38(6):A3618\u2013A3643. https:\/\/doi.org\/10.1137\/16M1060224","journal-title":"SIAM J Sci Comput"},{"issue":"2","key":"1554_CR7","doi-asserted-by":"publisher","first-page":"507","DOI":"10.4310\/CMS.2008.v6.n2.a12","volume":"6","author":"KC Chang","year":"2008","unstructured":"Chang KC, Pearson K, Zhang T (2008) Perron-Frobenius theorem for nonnegative tensors. Commun Math Sci 6(2):507\u2013520. https:\/\/doi.org\/10.4310\/CMS.2008.v6.n2.a12","journal-title":"Commun Math Sci"},{"issue":"4","key":"1554_CR8","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.3934\/jimo.2016.12.1227","volume":"12","author":"ZM Chen","year":"2016","unstructured":"Chen ZM, Qi LQ (2016) Circulant tensors with applications to spectral hypergraph theory and stochastic process. J Ind Manag Optim 12(4):1227\u20131247. https:\/\/doi.org\/10.3934\/jimo.2016.12.1227","journal-title":"J Ind Manag Optim"},{"issue":"9","key":"1554_CR9","doi-asserted-by":"publisher","first-page":"3268","DOI":"10.1016\/j.laa.2011.11.018","volume":"436","author":"J Cooper","year":"2012","unstructured":"Cooper J, Dutle A (2012) Spectra of uniform hypergraphs. Linear Algebra Appl 436(9):3268\u20133292. https:\/\/doi.org\/10.1016\/j.laa.2011.11.018","journal-title":"Linear Algebra Appl"},{"issue":"15","key":"1554_CR10","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.laa.2014.12.033","volume":"471","author":"LB Cui","year":"2015","unstructured":"Cui LB, Li W, Ng MK (2015) Primitive tensors and directed hypergraphs. Linear Algebra Appl 471(15):96\u2013108. https:\/\/doi.org\/10.1016\/j.laa.2014.12.033","journal-title":"Linear Algebra Appl"},{"issue":"1","key":"1554_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"YH Dai","year":"1999","unstructured":"Dai YH, Yuan YX (1999) A nonlinear conjugate gradient method with a strong global convergence property. SIAM J Optim 10(1):177\u2013182. https:\/\/doi.org\/10.1137\/S1052623497318992","journal-title":"SIAM J Optim"},{"key":"1554_CR12","volume-title":"Nonlinear conjugate gradient method","author":"YH Dai","year":"2001","unstructured":"Dai YH, Yuan YX (2001) Nonlinear conjugate gradient method. Shanghai Science and Technology Publisher, Shanghai"},{"issue":"4","key":"1554_CR13","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1137\/S0895479898346995","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer L, De Moor B, Vandewalle J (2000) On the best rank-1 and rank-(R1, R2, RN) approximation of higher-order tensors. SIAM J Matrix Anal A 21(4):1324\u20131342. https:\/\/doi.org\/10.1137\/S0895479898346995","journal-title":"SIAM J Matrix Anal A"},{"key":"1554_CR14","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connection with graphs. Numer Math 1:269\u2013271. https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numer Math"},{"key":"1554_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.cviu.2013.10.012","volume":"120","author":"A Ducournau","year":"2014","unstructured":"Ducournau A, Bretto A (2014) Random walks in directed hypergraphs and application to semisupervised image segmentation. Comput Vis Image Und 120:91\u2013102. https:\/\/doi.org\/10.1016\/j.cviu.2013.10.012","journal-title":"Comput Vis Image Und"},{"key":"1554_CR16","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R Fagin","year":"1983","unstructured":"Fagin R (1983) Degrees of acyclicity for hypergraphs and relational database systems. J ACM 30:514\u2013550. https:\/\/doi.org\/10.1145\/2402.322390","journal-title":"J ACM"},{"key":"1554_CR17","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.laa.2016.04.007","volume":"504","author":"YZ Fan","year":"2016","unstructured":"Fan YZ, Khan MI, Tan YY (2016) The largest H-eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs. Linear Algebra Appl 504:487\u2013502. https:\/\/doi.org\/10.1016\/j.laa.2016.04.007","journal-title":"Linear Algebra Appl"},{"issue":"2","key":"1554_CR18","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1016\/j.laa.2011.02.042","volume":"438","author":"S Friedland","year":"2013","unstructured":"Friedland S, Gaubert S, Han L (2013) Perron-Frobenius theorem for nonnegative multilinear forms and extensions. Linear Algebra Appl 438(2):738\u2013749. https:\/\/doi.org\/10.1016\/j.laa.2011.02.042","journal-title":"Linear Algebra Appl"},{"issue":"2\u20133","key":"1554_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","volume":"42","author":"G Gallo","year":"1993","unstructured":"Gallo G, Longo G, Pallottino S (1993) Directed hypergraphs and applications. Discrete Appl Math 42(2\u20133):177\u2013201. https:\/\/doi.org\/10.1016\/0166-218X(93)90045-P","journal-title":"Discrete Appl Math"},{"key":"1554_CR20","doi-asserted-by":"publisher","first-page":"1507","DOI":"10.1137\/140985160","volume":"36","author":"DF Gleich","year":"2015","unstructured":"Gleich DF, Lim LH, Yu Y (2015) Multilinear PageRank. SIAM J Matrix Anal A 36:1507\u20131541. https:\/\/doi.org\/10.1137\/140985160","journal-title":"SIAM J Matrix Anal A"},{"issue":"2","key":"1554_CR21","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100\u2013107. https:\/\/doi.org\/10.1109\/TSSC.1968.300136","journal-title":"IEEE Trans Syst Sci Cybern"},{"key":"1554_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.laa.2014.11.020","volume":"469","author":"SL Hu","year":"2015","unstructured":"Hu SL, Qi LQ, Xie JS (2015) The largest Laplacian and signless Laplacian H-eigenvalues of a uniform hypergraph. Linear Algebra Appl 469:1\u201327. https:\/\/doi.org\/10.1016\/j.laa.2014.11.020","journal-title":"Linear Algebra Appl"},{"issue":"3","key":"1554_CR23","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1287\/opre.9.3.296","volume":"9","author":"JE Kelley","year":"1961","unstructured":"Kelley JE (1961) Critical-path planning and scheduling: Mathematical Basis. Oper Res 9(3):296\u2013320. https:\/\/doi.org\/10.1287\/opre.9.3.296","journal-title":"Oper Res"},{"issue":"1\u20133","key":"1554_CR24","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0012-365X(00)00290-9","volume":"235","author":"EV Konstantinova","year":"2001","unstructured":"Konstantinova EV, Skorobogatov VA (2001) Application of hypergraph theory in chemistry. Discrete Math 235(1\u20133):365\u2013383. https:\/\/doi.org\/10.1016\/S0012-365X(00)00290-9","journal-title":"Discrete Math"},{"issue":"4","key":"1554_CR25","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1137\/100801482","volume":"32","author":"TG Kolda","year":"2011","unstructured":"Kolda TG, Mayo JR (2011) Shifted power method for computing tensor eigenpairs. SIAM J Matrix Anal A 32(4):1095\u20131124. https:\/\/doi.org\/10.1137\/100801482","journal-title":"SIAM J Matrix Anal A"},{"issue":"4","key":"1554_CR26","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1137\/140951758","volume":"35","author":"TG Kolda","year":"2014","unstructured":"Kolda TG, Mayo JR (2014) An adaptive shifted power methods for computing generalized tensor eigenpairs. SIAM J Matrix Anal A 35(4):1563\u20131581. https:\/\/doi.org\/10.1137\/140951758","journal-title":"SIAM J Matrix Anal A"},{"key":"1554_CR27","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. P Am Math Soc 7:48\u201350. https:\/\/doi.org\/10.1090\/S0002-9939-1956-0078686-7","journal-title":"P Am Math Soc"},{"key":"1554_CR28","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1090\/S0025-5718-06-01840-0","volume":"75","author":"W La Cruz","year":"2006","unstructured":"La Cruz W, Mart\u00ednez JM, Raydan M (2006) Spectral residual method without gradient information for solving large-scale nonlinear systems of equations. Math Comput 75:1429\u20131448. https:\/\/doi.org\/10.1090\/S0025-5718-06-01840-0","journal-title":"Math Comput"},{"issue":"1\u20132","key":"1554_CR29","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0012-365X(85)90156-6","volume":"57","author":"J Lehel","year":"1985","unstructured":"Lehel J (1985) A characterization of totally balanced hypergraphs. Discrete Math 57(1\u20132):59\u201365. https:\/\/doi.org\/10.1016\/0012-365X(85)90156-6","journal-title":"Discrete Math"},{"issue":"5","key":"1554_CR30","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ipl.2005.10.008","volume":"97","author":"K Li","year":"2006","unstructured":"Li K, Wang LS (2006) A polynomial time approximation scheme for embedding a directed hypergraph on a ring. Inform Process Lett 97(5):203\u2013207. https:\/\/doi.org\/10.1016\/j.ipl.2005.10.008","journal-title":"Inform Process Lett"},{"issue":"3","key":"1554_CR31","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1080\/10556788.2013.816306","volume":"29","author":"M Li","year":"2014","unstructured":"Li M (2014) A derivative-free PRP method for solving large-scale nonlinear systems of equations and its global convergence. Optim Method Softw 29(3):503\u2013514. https:\/\/doi.org\/10.1080\/10556788.2013.816306","journal-title":"Optim Method Softw"},{"key":"1554_CR32","doi-asserted-by":"publisher","unstructured":"Lim LH (2005) Singular values and eigenvalues of tensors: a variational approach. In: Proceedings of 1st IEEE International Wrkshop on Computational Advances in Multi-Sensor Adaptive Processing, 129\u2013132. https:\/\/doi.org\/10.1109\/CAMAP.2005.1574201","DOI":"10.1109\/CAMAP.2005.1574201"},{"key":"1554_CR33","unstructured":"Lovasz L (1973) Coverings and coloring of hypergraphs. In: Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica Publishing, Winnipeg, 3\u201312"},{"issue":"6","key":"1554_CR34","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/90.893870","volume":"8","author":"P Narvaez","year":"2000","unstructured":"Narvaez P, Siu KY, Tzeng HY (2000) New dynamic algorithms for shortest path tree computation. IEEE\/ACM Trans Netw 8(6):734\u2013746. https:\/\/doi.org\/10.1109\/90.893870","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"3","key":"1554_CR35","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1137\/09074838X","volume":"31","author":"M Ng","year":"2009","unstructured":"Ng M, Qi LQ, Zhou GL (2009) Finding the largest eigenvalue of a non-negative tensor. SIAM J Matrix Anal A 31(3):1090\u20131099. https:\/\/doi.org\/10.1137\/09074838X","journal-title":"SIAM J Matrix Anal A"},{"key":"1554_CR36","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s10898-014-0209-8","volume":"61","author":"Q Ni","year":"2015","unstructured":"Ni Q, Qi LQ (2015) A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map. J Global Optim 61:627\u2013641. https:\/\/doi.org\/10.1007\/s10898-014-0209-8","journal-title":"J Global Optim"},{"key":"1554_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-017-9973-y","volume":"70","author":"JW Nie","year":"2018","unstructured":"Nie JW, Zhang XZ (2018) Real eigenvalues of nonsymmetric tensors. Comput Optim Appl 70:1\u201332. https:\/\/doi.org\/10.1007\/s10589-017-9973-y","journal-title":"Comput Optim Appl"},{"key":"1554_CR38","doi-asserted-by":"publisher","unstructured":"Ortega JM, Rheinboldt WC (1970) Iterative Solution of Nonlinear Equations in Several Variables. SIAM, Philadelphia. https:\/\/doi.org\/10.1016\/C2013-0-11263-9","DOI":"10.1016\/C2013-0-11263-9"},{"issue":"6","key":"1554_CR39","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36(6):1389\u20131401. https:\/\/doi.org\/10.1002\/j.1538-7305.1957.tb01515.x","journal-title":"Bell Syst Tech J"},{"issue":"6","key":"1554_CR40","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1016\/j.jsc.2005.05.007","volume":"40","author":"LQ Qi","year":"2005","unstructured":"Qi LQ (2005) Eigenvalues of a real supersymmetric tensor. J Symb Comput 40(6):1302\u20131324. https:\/\/doi.org\/10.1016\/j.jsc.2005.05.007","journal-title":"J Symb Comput"},{"key":"1554_CR41","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10107-007-0193-6","volume":"118","author":"LQ Qi","year":"2009","unstructured":"Qi LQ, Wang F, Wang YJ (2009) Z-eigenvalue methods for a global polynomial optimization problems. Math Program 118:301\u2013316. https:\/\/doi.org\/10.1007\/s10107-007-0193-6","journal-title":"Math Program"},{"issue":"6","key":"1554_CR42","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.4310\/CMS.2014.v12.n6.a3","volume":"12","author":"LQ Qi","year":"2014","unstructured":"Qi LQ (2014) H$$^+$$-eigenvalues of Laplacian tensor and signless Laplacians. Commun Math Sci 12(6):1045\u20131064. https:\/\/doi.org\/10.4310\/CMS.2014.v12.n6.a3","journal-title":"Commun Math Sci"},{"key":"1554_CR43","doi-asserted-by":"publisher","unstructured":"Qi LQ, Luo ZY (2017) Tensor Analysis: Spectral Theory and Special Tensors. SIAM, Philadephia. https:\/\/doi.org\/10.1137\/1.9781611974751","DOI":"10.1137\/1.9781611974751"},{"key":"1554_CR44","doi-asserted-by":"publisher","first-page":"281","DOI":"10.2307\/2303897","volume":"46","author":"HE Robbins","year":"1939","unstructured":"Robbins HE (1939) A theorem on graphs with an application to a problem of traffic control. Am Math Mon 46:281\u2013283. https:\/\/doi.org\/10.2307\/2303897","journal-title":"Am Math Mon"},{"key":"1554_CR45","doi-asserted-by":"publisher","first-page":"335","DOI":"10.4153\/CMB-1978-058-5","volume":"21","author":"PJ Slater","year":"1978","unstructured":"Slater PJ (1978) A characterization of soft hypergraphs. Can Math Bull 21:335\u2013337. https:\/\/doi.org\/10.4153\/CMB-1978-058-5","journal-title":"Can Math Bull"},{"issue":"9","key":"1554_CR46","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"BM Waxman","year":"1988","unstructured":"Waxman BM (1988) Routing of multipoint connections. IEEE J Sel Area Comm 6(9):1617\u20131622. https:\/\/doi.org\/10.1109\/49.12889","journal-title":"IEEE J Sel Area Comm"},{"issue":"2","key":"1554_CR47","first-page":"318","volume":"12","author":"JS Xie","year":"2015","unstructured":"Xie JS, Qi LQ (2015) The clique and coclique numbers\u2019 bounds based on the H-eigenvalues of uniform hypergraphs. Int J Numer Anal Mod 12(2):318\u2013327","journal-title":"Int J Numer Anal Mod"},{"issue":"4","key":"1554_CR48","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1080\/03081087.2015.1125838","volume":"64","author":"JS Xie","year":"2016","unstructured":"Xie JS, Qi LQ (2016) Spectral directed hypergraph theory via tensors. Linear Multilinear A 64(4):780\u2013794. https:\/\/doi.org\/10.1080\/03081087.2015.1125838","journal-title":"Linear Multilinear A"},{"issue":"10","key":"1554_CR49","doi-asserted-by":"publisher","first-page":"1968","DOI":"10.1080\/00207160.2016.1274740","volume":"94","author":"WW Yang","year":"2017","unstructured":"Yang WW, Ni Q (2017) A new cubically convergent method for solving a system of nonlinear equation. Int J Comput Math 94(10):1968\u20131980. https:\/\/doi.org\/10.1080\/00207160.2016.1274740","journal-title":"Int J Comput Math"},{"issue":"4","key":"1554_CR50","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1007\/s11075-017-0358-1","volume":"77","author":"WW Yang","year":"2018","unstructured":"Yang WW, Ni Q (2018) A cubically convergent method for solving the largest eigenvalue of a nonnegative irreducible tensor. Numer Algorithms 77(4):1183\u20131197. https:\/\/doi.org\/10.1007\/s11075-017-0358-1","journal-title":"Numer Algorithms"},{"issue":"5","key":"1554_CR51","doi-asserted-by":"publisher","first-page":"2517","DOI":"10.1137\/090778766","volume":"31","author":"YN Yang","year":"2010","unstructured":"Yang YN, Yang QZ (2010) Further results for Perron-Frobenius Theorem for nonnegative tensors. SIAM J Matrix Anal A 31(5):2517\u20132530. https:\/\/doi.org\/10.1137\/090778766","journal-title":"SIAM J Matrix Anal A"},{"issue":"4","key":"1554_CR52","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1137\/100813671","volume":"32","author":"QZ Yang","year":"2011","unstructured":"Yang QZ, Yang YN (2011) Further results for Perron-Frobenius Theorem for nonnegative tensors II. SIAM J Matrix Anal A 32(4):1236\u20131250. https:\/\/doi.org\/10.1137\/100813671","journal-title":"SIAM J Matrix Anal A"},{"key":"1554_CR53","unstructured":"Yang YN, Yang QZ (2011) On some properties of nonnegative weakly irreducible tensors. arXiv:1111.0713v1"},{"issue":"1","key":"1554_CR54","doi-asserted-by":"publisher","first-page":"149","DOI":"10.3934\/jimo.2010.6.149","volume":"6","author":"GH Yu","year":"2010","unstructured":"Yu GH (2010) A derivative-free method for solving large-scale nonlinear systems of equations. J Ind Manag Optim 6(1):149\u2013160. https:\/\/doi.org\/10.3934\/jimo.2010.6.149","journal-title":"J Ind Manag Optim"},{"key":"1554_CR55","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s10589-016-9846-9","volume":"65","author":"GH Yu","year":"2016","unstructured":"Yu GH, Yu ZF, Xu Y, Song YS, Zhou Y (2016) An adaptive gradient method for computing generalized tensor eigenpairs. Comput Optim Appl 65:781\u2013797. https:\/\/doi.org\/10.1007\/s10589-016-9846-9","journal-title":"Comput Optim Appl"},{"issue":"2","key":"1554_CR56","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1080\/10556788.2019.1647196","volume":"35","author":"X Zhang","year":"2020","unstructured":"Zhang X, Ni Q, Ge ZL (2020) A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor. Optim Method Softw 35(2):377\u2013393. https:\/\/doi.org\/10.1080\/10556788.2019.1647196","journal-title":"Optim Method Softw"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01554-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-021-01554-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01554-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T10:29:31Z","timestamp":1625912971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-021-01554-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,18]]},"references-count":56,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1554"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01554-y","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2021,6,18]]},"assertion":[{"value":"11 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"170"}}