{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T00:07:49Z","timestamp":1778717269021,"version":"3.51.4"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T00:00:00Z","timestamp":1754092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T00:00:00Z","timestamp":1754092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Simons Collaboration on Algorithms and Geometry"},{"name":"National Science Foundation, United States","award":["NSF DMS 2309782, NSF BIGDATA IIS-1837992"],"award-info":[{"award-number":["NSF DMS 2309782, NSF BIGDATA IIS-1837992"]}]},{"name":"Department of Energy, United States","award":["DE SC0025312"],"award-info":[{"award-number":["DE SC0025312"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s11075-025-02165-y","type":"journal-article","created":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T10:34:19Z","timestamp":1754130859000},"page":"1011-1048","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Subspace power method for symmetric tensor decomposition"],"prefix":"10.1007","volume":"102","author":[{"given":"Joe","family":"Kileel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00e3o M.","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,2]]},"reference":[{"issue":"3","key":"2165_CR1","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111x","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009). https:\/\/doi.org\/10.1137\/07070111x","journal-title":"SIAM Rev."},{"issue":"9","key":"2165_CR2","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.: Spectra of uniform hypergraphs. Linear Algebra Appl. 436(9), 3268\u20133292 (2012). https:\/\/doi.org\/10.1016\/j.laa.2011.11.018","journal-title":"Linear Algebra Appl."},{"key":"2165_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.laa.2016.12.022","volume":"518","author":"A Banerjee","year":"2017","unstructured":"Banerjee, A., Char, A., Mondal, B.: Spectra of general hypergraphs. Lin. Alg. Appl. 518, 14\u201330 (2017). https:\/\/doi.org\/10.1016\/j.laa.2016.12.022","journal-title":"Lin. Alg. Appl."},{"issue":"10","key":"2165_CR4","doi-asserted-by":"publisher","first-page":"2009","DOI":"10.1109\/5.720250","volume":"86","author":"J-F Cardoso","year":"1998","unstructured":"Cardoso, J.-F.: Blind signal separation: Statistical principles. Proc. IEEE 86(10), 2009\u20132025 (1998). https:\/\/doi.org\/10.1109\/5.720250","journal-title":"Proc. IEEE"},{"issue":"6","key":"2165_CR5","doi-asserted-by":"publisher","first-page":"2965","DOI":"10.1109\/tsp.2007.893943","volume":"55","author":"L De Lathauwer","year":"2007","unstructured":"De Lathauwer, L., Castaing, J., Cardoso, J.-F.: Fourth-order cumulant-based blind identification of underdetermined mixtures. IEEE Trans. Signal Process. 55(6), 2965\u20132973 (2007). https:\/\/doi.org\/10.1109\/tsp.2007.893943","journal-title":"IEEE Trans. Signal Process."},{"key":"2165_CR6","doi-asserted-by":"publisher","unstructured":"Hyv\u00e4rinen, A., Karhunen, J., Oja, E.: Independent Component Analysis vol. 46, (2001). https:\/\/doi.org\/10.1002\/0471221317","DOI":"10.1002\/0471221317"},{"key":"2165_CR7","unstructured":"Podosinnikova, A., Perry, A., Wein, A., Bach, F., d\u2019Aspremont, A., Sontag, D.: Overcomplete independent component analysis via SDP. In: Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 89, pp. 2583\u20132592 (2019). https:\/\/proceedings.mlr.press\/v89\/podosinnikova19a.html"},{"key":"2165_CR8","doi-asserted-by":"publisher","unstructured":"Dogan, M.C., Mendel, J.M.: Applications of cumulants to array processing. I. Aperture extension and array calibration. IEEE Trans. Signal Process. 43(5), 1200\u20131216 (1995). https:\/\/doi.org\/10.1109\/78.382404","DOI":"10.1109\/78.382404"},{"issue":"4","key":"2165_CR9","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1109\/tsp.2005.843703","volume":"53","author":"P Chevalier","year":"2005","unstructured":"Chevalier, P., Albera, L., Ferr\u00e9ol, A., Comon, P.: On the virtual array concept for higher order array processing. IEEE Trans. Signal Process. 53(4), 1254\u20131271 (2005). https:\/\/doi.org\/10.1109\/tsp.2005.843703","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"2165_CR10","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1109\/78.502327","volume":"44","author":"A-J Veen","year":"1996","unstructured":"Veen, A.-J., Paulraj, A.: An analytical constant modulus algorithm. IEEE Trans. Signal Process. 44(5), 1136\u20131155 (1996). https:\/\/doi.org\/10.1109\/78.502327","journal-title":"IEEE Trans. Signal Process."},{"issue":"1\u20132","key":"2165_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/s0165-1684(98)00183-2","volume":"73","author":"P Chevalier","year":"1999","unstructured":"Chevalier, P.: Optimal separation of independent narrow-band sources: Concept and performance. Signal Process. 73(1\u20132), 27\u201347 (1999). https:\/\/doi.org\/10.1016\/s0165-1684(98)00183-2","journal-title":"Signal Process."},{"issue":"3","key":"2165_CR12","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/bf02310791","volume":"35","author":"JD Carroll","year":"1970","unstructured":"Carroll, J.D., Chang, J.-J.: Analysis of individual differences in multidimensional scaling via an N-way generalization of Eckart-Young decomposition. Psychometrika 35(3), 283\u2013319 (1970). https:\/\/doi.org\/10.1007\/bf02310791","journal-title":"Psychometrika"},{"key":"2165_CR13","doi-asserted-by":"publisher","unstructured":"Bro, R.: PARAFAC. Tutorial and applications. Chemom. Intell. Lab. Syst. 38(2), 149\u2013171 (1997). https:\/\/doi.org\/10.1016\/s0169-7439(97)00032-4","DOI":"10.1016\/s0169-7439(97)00032-4"},{"issue":"2","key":"2165_CR14","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.sigpro.2006.02.050","volume":"87","author":"PJ Basser","year":"2007","unstructured":"Basser, P.J., Pajevic, S.: Spectral decomposition of a 4th-order covariance tensor: Applications to diffusion tensor MRI. Signal Process. 87(2), 220\u2013236 (2007). https:\/\/doi.org\/10.1016\/j.sigpro.2006.02.050","journal-title":"Signal Process."},{"key":"2165_CR15","doi-asserted-by":"publisher","unstructured":"Ge, R., Huang, Q., Kakade, S.M.: Learning mixtures of Gaussians in high dimensions. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing. STOC \u201915, pp. 761\u2013770, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2746539.2746616","DOI":"10.1145\/2746539.2746616"},{"key":"2165_CR16","unstructured":"Pereira, J.M., Kileel, J., Kolda, T.G.: Tensor moments of Gaussian mixture models: Theory and applications. arXiv:2202.06930. (2022)"},{"issue":"80","key":"2165_CR17","first-page":"2773","volume":"15","author":"A Anandkumar","year":"2014","unstructured":"Anandkumar, A., Ge, R., Hsu, D.J., Kakade, S.M., Telgarsky, M.: Tensor decompositions for learning latent variable models. J. Mach. Learn. Res. 15(80), 2773\u20132832 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"2165_CR18","doi-asserted-by":"crossref","unstructured":"Landsberg, J.M.: Tensors: Geometry and Applications vol. 128, (2012)","DOI":"10.1090\/gsm\/128"},{"issue":"6","key":"2165_CR19","doi-asserted-by":"publisher","first-page":"4021","DOI":"10.1090\/tran\/6762","volume":"369","author":"L Chiantini","year":"2016","unstructured":"Chiantini, L., Ottaviani, G., Vannieuwenhoven, N.: On generic identifiability of symmetric tensors of subgeneric rank. Trans. Am. Math. Soc. 369(6), 4021\u20134042 (2016). https:\/\/doi.org\/10.1090\/tran\/6762","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"2165_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.2478\/bf02479194","volume":"3","author":"E Ballico","year":"2005","unstructured":"Ballico, E.: On the weak non-defectivity of Veronese embeddings of projective spaces. Cent. Eur. J. Math. 3(2), 183\u2013187 (2005). https:\/\/doi.org\/10.2478\/bf02479194","journal-title":"Cent. Eur. J. Math."},{"issue":"1","key":"2165_CR21","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1090\/s0002-9947-01-02810-0","volume":"354","author":"L Chiantini","year":"2001","unstructured":"Chiantini, L., Ciliberto, C.: Weakly defective varieties. Trans. Am. Math. Soc. 354(1), 151\u2013178 (2001). https:\/\/doi.org\/10.1090\/s0002-9947-01-02810-0","journal-title":"Trans. Am. Math. Soc."},{"key":"2165_CR22","doi-asserted-by":"publisher","unstructured":"Hillar, C.J., Lim, L.-H.: Most tensor problems are NP-hard. J. ACM 60(6) (2013). https:\/\/doi.org\/10.1145\/2512329","DOI":"10.1145\/2512329"},{"key":"2165_CR23","first-page":"1","volume":"16","author":"RA Harshman","year":"1970","unstructured":"Harshman, R.A.: Foundations of the PARAFAC procedure: Models and conditions for an \u201cexplanatory\u2019\u2019 multi-model factor analysis. UCLA Working Papers in Phonetics 16, 1\u201384 (1970)","journal-title":"UCLA Working Papers in Phonetics"},{"issue":"1","key":"2165_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-015-0895-0","volume":"151","author":"TG Kolda","year":"2015","unstructured":"Kolda, T.G.: Numerical optimization for symmetric tensor decomposition. Math. Program. 151(1), 225\u2013248 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0895-0","journal-title":"Math. Program."},{"issue":"2","key":"2165_CR25","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s10107-020-01579-x","volume":"193","author":"R Ge","year":"2022","unstructured":"Ge, R., Ma, T.: On the optimization landscape of tensor decompositions. Math. Program. 193(2), 713\u2013759 (2022). https:\/\/doi.org\/10.1007\/s10107-020-01579-x","journal-title":"Math. Program."},{"key":"2165_CR26","doi-asserted-by":"publisher","unstructured":"Ma, T., Shi, J., Steurer, D.: Polynomial-time tensor decompositions with sum-of-squares. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 438\u2013446 (2016). https:\/\/doi.org\/10.1109\/focs.2016.54","DOI":"10.1109\/focs.2016.54"},{"key":"2165_CR27","doi-asserted-by":"publisher","unstructured":"Hopkins, S.B., Schramm, T., Shi, J., Steurer, D.: Fast spectral algorithms from sum-of-squares proofs: Tensor decomposition and planted sparse vectors. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing. STOC \u201916 (2016). https:\/\/doi.org\/10.1145\/2897518.2897529","DOI":"10.1145\/2897518.2897529"},{"issue":"4","key":"2165_CR28","doi-asserted-by":"publisher","first-page":"1517","DOI":"10.1137\/16m1107528","volume":"38","author":"J Nie","year":"2017","unstructured":"Nie, J.: Low rank symmetric tensor approximations. SIAM J. Matrix Anal. Appl. 38(4), 1517\u20131540 (2017). https:\/\/doi.org\/10.1137\/16m1107528","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2165_CR29","doi-asserted-by":"publisher","unstructured":"Johnston, N., Lovitz, B., Vijayaraghavan, A.: Computing linear sections of varieties: Quantum entanglement, tensor decompositions and beyond. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (2023). https:\/\/doi.org\/10.1109\/focs57990.2023.00079","DOI":"10.1109\/focs57990.2023.00079"},{"key":"2165_CR30","doi-asserted-by":"publisher","unstructured":"Wein, A.S.: Average-case complexity of tensor decomposition for low-degree polynomials. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing. STOC 2023, pp. 1685\u20131698, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3564246.3585232","DOI":"10.1145\/3564246.3585232"},{"issue":"4","key":"2165_CR31","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1137\/100801482","volume":"32","author":"TG Kolda","year":"2011","unstructured":"Kolda, T.G., Mayo, J.R.: Shifted power method for computing tensor eigenpairs. SIAM J. Matrix Anal. Appl. 32(4), 1095\u20131124 (2011). https:\/\/doi.org\/10.1137\/100801482","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"2165_CR32","doi-asserted-by":"publisher","first-page":"621","DOI":"10.4208\/jcm.2005-m2019-0298","volume":"39","author":"Y Tang","year":"2021","unstructured":"Tang, Y., Yang, Q., Luo, G.: Convergence analysis on SS-HOPM for BEC-like nonlinear eigenvalue problems. J. Comput. Math. 39(4), 621\u2013632 (2021). https:\/\/doi.org\/10.4208\/jcm.2005-m2019-0298","journal-title":"J. Comput. Math."},{"key":"2165_CR33","doi-asserted-by":"publisher","unstructured":"Iarrobino, A., Kanev, V.: Power Sums, Gorenstein Algebras, and Determinantal Loci, (1999). https:\/\/doi.org\/10.1007\/bfb0093426","DOI":"10.1007\/bfb0093426"},{"issue":"12","key":"2165_CR34","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1080\/14786445108645733","volume":"2","author":"JJ Sylvester","year":"1851","unstructured":"Sylvester, J.J.: On a remarkable discovery in the theory of canonical forms and of hyperdeterminants. Lond. Edinb. Dubl. Phil. Mag. Philos. Mag. J. Sci. 2(12), 391\u2013410 (1851). https:\/\/doi.org\/10.1080\/14786445108645733","journal-title":"Lond. Edinb. Dubl. Phil. Mag. Philos. Mag. J. Sci."},{"issue":"11\u201312","key":"2165_CR35","doi-asserted-by":"publisher","first-page":"1851","DOI":"10.1016\/j.laa.2010.06.046","volume":"433","author":"J Brachat","year":"2010","unstructured":"Brachat, J., Comon, P., Mourrain, B., Tsigaridas, E.: Symmetric tensor decomposition. Linear Algebra Appl. 433(11\u201312), 1851\u20131872 (2010). https:\/\/doi.org\/10.1016\/j.laa.2010.06.046","journal-title":"Linear Algebra Appl."},{"key":"2165_CR36","doi-asserted-by":"publisher","unstructured":"Bhaskara, A., Chen, A., Perreault, A., Vijayaraghavan, A.: Smoothed analysis in unsupervised learning via decoupling. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp. 582\u2013610 (2019). https:\/\/doi.org\/10.1109\/focs.2019.00043","DOI":"10.1109\/focs.2019.00043"},{"key":"2165_CR37","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.jsc.2012.11.005","volume":"54","author":"L Oeding","year":"2013","unstructured":"Oeding, L., Ottaviani, G.: Eigenvectors of tensors and algorithms for Waring decomposition. J. Symb. Comput. 54, 9\u201335 (2013). https:\/\/doi.org\/10.1016\/j.jsc.2012.11.005","journal-title":"J. Symb. Comput."},{"issue":"4","key":"2165_CR38","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1137\/1037124","volume":"37","author":"Chu, M.T., Funderlic, R.E., Golub, G.H.","year":"1995","unstructured":"Chu, M.T., Funderlic, R.E., Golub, G.H.: A rank-one reduction formula and its applications to matrix factorizations. SIAM Rev. 37(4), 512\u2013530 (1995). https:\/\/doi.org\/10.1137\/1037124","journal-title":"SIAM Rev."},{"issue":"2","key":"2165_CR39","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1093\/imaiai\/iaaa036","volume":"10","author":"M Fornasier","year":"2021","unstructured":"Fornasier, M., Vyb\u00edral, J., Daubechies, I.: Robust and resource efficient identification of shallow neural networks by fewest samples. Information and Inference: A Journal of the IMA 10(2), 625\u2013695 (2021). https:\/\/doi.org\/10.1093\/imaiai\/iaaa036","journal-title":"Information and Inference: A Journal of the IMA"},{"issue":"1\u20132","key":"2165_CR40","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-016-1042-2","volume":"162","author":"Y Nakatsukasa","year":"2016","unstructured":"Nakatsukasa, Y., Soma, T., Uschmajew, A.: Finding a low-rank basis in a matrix subspace. Math. Program. 162(1\u20132), 325\u2013361 (2016). https:\/\/doi.org\/10.1007\/s10107-016-1042-2","journal-title":"Math. Program."},{"issue":"22","key":"2165_CR41","doi-asserted-by":"publisher","first-page":"5924","DOI":"10.1109\/tsp.2015.2458785","volume":"63","author":"A-H Phan","year":"2015","unstructured":"Phan, A.-H., Tichavsky, P., Cichocki, A.: Tensor deflation for CANDECOMP\/PARAFAC - Part I: Alternating subspace update algorithm. IEEE Trans. Signal Process. 63(22), 5924\u20135938 (2015). https:\/\/doi.org\/10.1109\/tsp.2015.2458785","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"2165_CR42","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1137\/0614071","volume":"14","author":"SE Leurgans","year":"1993","unstructured":"Leurgans, S.E., Ross, R.T., Abel, R.B.: A decomposition for three-way arrays. SIAM J. Matrix Anal. Appl. 14(4), 1064\u20131083 (1993). https:\/\/doi.org\/10.1137\/0614071","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2165_CR43","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1137\/18m1200531","volume":"40","author":"C Beltr\u00e1n","year":"2019","unstructured":"Beltr\u00e1n, C., Breiding, P., Vannieuwenhoven, N.: Pencil-based algorithms for tensor rank decomposition are not stable. SIAM J. Matrix Anal. Appl. 40(2), 739\u2013773 (2019). https:\/\/doi.org\/10.1137\/18m1200531","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2165_CR44","doi-asserted-by":"publisher","unstructured":"Vervliet, N., Debals, O., De\u00a0Lathauwer, L.: Tensorlab 3.0 \u2014 numerical optimization strategies for large-scale constrained and coupled matrix\/tensor factorization. In: 2016 50th Asilomar Conference on Signals, Systems and Computers, pp. 1733\u20131738 (2016). https:\/\/doi.org\/10.1109\/ACSSC.2016.7869679","DOI":"10.1109\/ACSSC.2016.7869679"},{"issue":"2","key":"2165_CR45","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10208-015-9291-7","volume":"17","author":"J Nie","year":"2015","unstructured":"Nie, J.: Generating polynomials and symmetric tensor decompositions. Found. Comput. Math. 17(2), 423\u2013465 (2015). https:\/\/doi.org\/10.1007\/s10208-015-9291-7","journal-title":"Found. Comput. Math."},{"key":"2165_CR46","doi-asserted-by":"publisher","unstructured":"Cardoso, J.-F.: Super-symmetric decomposition of the fourth-order cumulant tensor. blind identification of more sources than sensors. In: International Conference on Acoustics, Speech, and Signal Processing (ICASSP), pp. 3109\u20133112 (1991). https:\/\/doi.org\/10.1109\/icassp.1991.150113","DOI":"10.1109\/icassp.1991.150113"},{"key":"2165_CR47","doi-asserted-by":"publisher","unstructured":"Lim, L.-H.: Singular values and eigenvalues of tensors: A variational approach. In: 1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005., pp. 129\u2013132 (2005). https:\/\/doi.org\/10.1109\/camap.2005.1574201","DOI":"10.1109\/camap.2005.1574201"},{"issue":"6","key":"2165_CR48","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1016\/j.jsc.2005.05.007","volume":"40","author":"L Qi","year":"2005","unstructured":"Qi, L.: Eigenvalues of a real supersymmetric tensor. J. Symb. Comput. 40(6), 1302\u20131324 (2005). https:\/\/doi.org\/10.1016\/j.jsc.2005.05.007","journal-title":"J. Symb. Comput."},{"key":"2165_CR49","doi-asserted-by":"publisher","unstructured":"Hackbusch, W.: Tensor Spaces and Numerical Tensor Calculus. Springer Series in Computational Mathematics, vol. 56 (2019). https:\/\/doi.org\/10.1007\/978-3-642-28027-6","DOI":"10.1007\/978-3-642-28027-6"},{"key":"2165_CR50","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2189-8","author":"J Harris","year":"1992","unstructured":"Harris, J.: Algebr. Geom. (1992). https:\/\/doi.org\/10.1007\/978-1-4757-2189-8","journal-title":"Algebr. Geom."},{"key":"2165_CR51","doi-asserted-by":"publisher","unstructured":"Hartshorne, R.: Algebraic Geometry vol. 52, (1977). https:\/\/doi.org\/10.1007\/978-1-4757-3849-0","DOI":"10.1007\/978-1-4757-3849-0"},{"key":"2165_CR52","unstructured":"Kileel, J., Klock, T., Pereira, M.J.: Landscape analysis of an improved power method for tensor decomposition. In: Advances in Neural Information Processing Systems, vol. 34, pp. 6253\u20136265 (2021). https:\/\/proceedings.neurips.cc\/paper\/2021\/file\/31784d9fc1fa0d25d04eae50ac9bf787-Paper.pdf"},{"key":"2165_CR53","doi-asserted-by":"publisher","DOI":"10.1017\/9781009166164","author":"N Boumal","year":"2023","unstructured":"Boumal, N.: An introduction to optimization on smooth manifolds (2023). https:\/\/doi.org\/10.1017\/9781009166164","journal-title":"An introduction to optimization on smooth manifolds"},{"key":"2165_CR54","doi-asserted-by":"publisher","unstructured":"Absil, P.-A., Mahony, R., Trumpf, J.: An extrinsic look at the Riemannian Hessian. In: International Conference on Geometric Science of Information, pp. 361\u2013368 (2013). https:\/\/doi.org\/10.1007\/978-3-642-40020-9_39","DOI":"10.1007\/978-3-642-40020-9_39"},{"key":"2165_CR55","volume-title":"Ensembles semi-analytiques","author":"S \u0141ojasiewicz","year":"1965","unstructured":"\u0141ojasiewicz, S.: Ensembles semi-analytiques. France, Institute Des Hautes \u00c9tudes Scientifiques (IHES) Notes, Bures-sur-Yvette (1965)"},{"issue":"1","key":"2165_CR56","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1137\/140957822","volume":"25","author":"R Schneider","year":"2015","unstructured":"Schneider, R., Uschmajew, A.: Convergence results for projected line-search methods on varieties of low-rank matrices via \u0141ojasiewicz inequality. SIAM J. Optim. 25(1), 622\u2013646 (2015). https:\/\/doi.org\/10.1137\/140957822","journal-title":"SIAM J. Optim."},{"key":"2165_CR57","unstructured":"Panageas, I., Piliouras, G.: Gradient descent only converges to minimizers: Non-isolated critical points and invariant regions. In: 8th Innovations in Theoretical Computer Science (ITCS) (2017)"},{"key":"2165_CR58","unstructured":"Lee, J.D., Simchowitz, M., Jordan, M.I., Recht, B.: Gradient descent only converges to minimizers. In: Conference on Learning Theory (COLT), vol. 49, pp. 1246\u20131257 (2016). https:\/\/proceedings.mlr.press\/v49\/lee16.html"},{"key":"2165_CR59","unstructured":"Munkres, J.R.: Topology, 2nd edn. (2000)"},{"key":"2165_CR60","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970012","author":"WC Rheinboldt","year":"1998","unstructured":"Rheinboldt, W.C.: Methods for Solving Systems of Nonlinear Equations: Second Edition (1998). https:\/\/doi.org\/10.1137\/1.9781611970012","journal-title":"Methods for Solving Systems of Nonlinear Equations: Second Edition"},{"key":"2165_CR61","unstructured":"Vervliet, N., Debals, O., Sorber, L., Van\u00a0Barel, M., De\u00a0Lathauwer, L.: Tensorlab 3.0. Available online. (2016)"},{"issue":"4","key":"2165_CR62","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1137\/140951758","volume":"35","author":"TG Kolda","year":"2014","unstructured":"Kolda, T.G., Mayo, J.R.: An adaptive shifted power method for computing generalized tensor eigenpairs. SIAM J. Matrix Anal. Appl. 35(4), 1563\u20131581 (2014). https:\/\/doi.org\/10.1137\/140951758","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2165_CR63","doi-asserted-by":"publisher","unstructured":"Li, R., Principe, J.C.: Blinking artifact removal in cognitive EEG data using ICA. In: 2006 International Conference of the IEEE Engineering in Medicine and Biology Society, pp. 5273\u20135276 (2006). https:\/\/doi.org\/10.1109\/IEMBS.2006.260605","DOI":"10.1109\/IEMBS.2006.260605"},{"issue":"4","key":"2165_CR64","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/TNSRE.2010.2053387","volume":"18","author":"R Chavarriaga","year":"2010","unstructured":"Chavarriaga, R., Millan, J.D.R.: Learning from EEG error-related potentials in noninvasive brain-computer interfaces. IEEE Trans. Neural Syst. Rehabil. Eng. 18(4), 381\u2013388 (2010). https:\/\/doi.org\/10.1109\/TNSRE.2010.2053387","journal-title":"IEEE Trans. Neural Syst. Rehabil. Eng."},{"issue":"3","key":"2165_CR65","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1137\/060661685","volume":"30","author":"L De Lathauwer","year":"2008","unstructured":"De Lathauwer, L.: Decompositions of a higher-order tensor in block terms\u2013Part I: Lemmas for partitioned matrices. SIAM J. Matrix Anal. Appl. 30(3), 1022\u20131032 (2008). https:\/\/doi.org\/10.1137\/060661685","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2165_CR66","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1137\/070690729","volume":"30","author":"L De Lathauwer","year":"2008","unstructured":"De Lathauwer, L.: Decompositions of a higher-order tensor in block terms\u2013Part II: Definitions and uniqueness. SIAM J. Matrix Anal. Appl. 30(3), 1033\u20131066 (2008). https:\/\/doi.org\/10.1137\/070690729","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2165_CR67","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1137\/070690730","volume":"30","author":"L De Lathauwer","year":"2008","unstructured":"De Lathauwer, L., Nion, D.: Decompositions of a higher-order tensor in block terms\u2013Part III: Alternating least squares algorithms. SIAM J. Matrix Anal. Appl. 30(3), 1067\u20131083 (2008). https:\/\/doi.org\/10.1137\/070690730","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2165_CR68","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1137\/19m1299633","volume":"41","author":"S Sherman","year":"2020","unstructured":"Sherman, S., Kolda, T.G.: Estimating higher-order moments using symmetric tensor decomposition. SIAM J. Matrix Anal. Appl. 41(3), 1369\u20131387 (2020). https:\/\/doi.org\/10.1137\/19m1299633","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2165_CR69","doi-asserted-by":"publisher","unstructured":"Shub, M.: Global Stability of Dynamical Systems (2013). https:\/\/doi.org\/10.1007\/978-1-4757-1947-5","DOI":"10.1007\/978-1-4757-1947-5"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02165-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02165-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02165-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T23:12:51Z","timestamp":1778713971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02165-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,2]]},"references-count":69,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["2165"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02165-y","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,2]]},"assertion":[{"value":"22 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2025","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 no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}