{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T16:01:15Z","timestamp":1780416075459,"version":"3.54.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T00:00:00Z","timestamp":1659139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T00:00:00Z","timestamp":1659139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program","doi-asserted-by":"crossref","award":["2018YFA0306702"],"award-info":[{"award-number":["2018YFA0306702"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program","doi-asserted-by":"crossref","award":["2020YFA0712300"],"award-info":[{"award-number":["2020YFA0712300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771328"],"award-info":[{"award-number":["11771328"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LD19A010002"],"award-info":[{"award-number":["LD19A010002"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Young Elite Scientists Sponsorship Program"},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801548"],"award-info":[{"award-number":["11801548"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11688101"],"award-info":[{"award-number":["11688101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CAS Project for Young Scientists in Basic Research","award":["YSBR-008"],"award-info":[{"award-number":["YSBR-008"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10107-022-01867-8","type":"journal-article","created":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T13:03:28Z","timestamp":1659186208000},"page":"1305-1364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations"],"prefix":"10.1007","volume":"199","author":[{"given":"Shenglong","family":"Hu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3193-7264","authenticated-orcid":false,"given":"Ke","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,30]]},"reference":[{"key":"1867_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"P-A Absil","year":"2008","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton, USA (2008)"},{"key":"1867_CR2","first-page":"2773","volume":"15","author":"A Anandkumar","year":"2014","unstructured":"Anandkumar, A., Ge, R., Hsu, D., Kakade, S.M., Telgarsky, M.: Tensor decompositions for learning latent variable models. J. Mach. Learn. Res. 15, 2773\u20132832 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"1867_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK Users\u2019 Guide","author":"E Anderson","year":"1999","unstructured":"Anderson, E., Bai, Z.Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users\u2019 Guide, 3rd edn. SIAM, Philadelphia, PA (1999)","edition":"3"},{"key":"1867_CR4","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"1867_CR5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"1867_CR6","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-Order Methods in Optimization. MOS-SIAM Series on Optimization, SIAM (2017)","DOI":"10.1137\/1.9781611974997"},{"key":"1867_CR7","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont, USA (1999)","edition":"2"},{"key":"1867_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03718-8","volume-title":"Real Algebraic Geometry. Ergebnisse der Mathematik und ihrer Grenzgebiete","author":"J Bochnak","year":"1998","unstructured":"Bochnak, J., Coste, M., Roy, M.-F.: Real Algebraic Geometry. Ergebnisse der Mathematik und ihrer Grenzgebiete, vol. 36. Springer, Berlin (1998)"},{"issue":"2","key":"1867_CR9","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.S., Shiota, M.: Clarke subgradients of stratifiable manifolds. SIAM J. Optim. 18(2), 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"key":"1867_CR10","doi-asserted-by":"crossref","first-page":"3319","DOI":"10.1090\/S0002-9947-09-05048-X","volume":"362","author":"J Bolte","year":"2010","unstructured":"Bolte, J., Daniilidis, A., Ley, O., Mazet, L.: Characterizations of \u0141ojasiewicz inequalities and applications: subgradient flows, talweg, convexity. Trans. Am. Math. Soc. 362, 3319\u20133363 (2010)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1\u20132","key":"1867_CR11","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"1867_CR12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s11856-017-1588-6","volume":"222","author":"A Boralevi","year":"2017","unstructured":"Boralevi, A., Draisma, J., Horobet, E., Robeva, E.: Orthogonal and unitary tensor decomposition from an algebraic perspective. Isr. J. Math. 222, 223\u2013260 (2017)","journal-title":"Isr. J. Math."},{"key":"1867_CR13","doi-asserted-by":"crossref","first-page":"1709","DOI":"10.1137\/070711621","volume":"30","author":"J Chen","year":"2009","unstructured":"Chen, J., Saad, Y.: On the tensor SVD and the optimal low rank orthogonal approximation of tensors. SIAM J. Matrix Anal. Appl. 30, 1709\u20131734 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0165-1684(94)90029-9","volume":"36","author":"P Comon","year":"1994","unstructured":"Comon, P.: Independent component analysis, a new concept? Signal Process. 36, 287\u2013314 (1994)","journal-title":"Signal Process."},{"key":"1867_CR15","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/MSP.2014.2298533","volume":"31","author":"P Comon","year":"2014","unstructured":"Comon, P.: Tensors: a brief introduction. IEEE Signal Proc. Mag. 31, 44\u201353 (2014)","journal-title":"IEEE Signal Proc. Mag."},{"key":"1867_CR16","volume-title":"Handbook of Blind Source Separation","author":"P Comon","year":"2010","unstructured":"Comon, P., Jutten, C.: Handbook of Blind Source Separation. Academic Press, Oxford (2010)"},{"key":"1867_CR17","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4064\/ap87-0-5","volume":"87","author":"D D\u2019 Acunto","year":"2005","unstructured":"D\u2019 Acunto, D., Kurdyka, K.: Explicit bounds for the \u0141ojasiewicz exponent in the gradient inequality for polynomials. Ann. Polon. Math. 87, 51\u201361 (2005)","journal-title":"Ann. Polon. Math."},{"key":"1867_CR18","doi-asserted-by":"crossref","first-page":"1324","DOI":"10.1137\/S0895479898346995","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: On the best rank-1 and rank-$$(r_1, r_2,\\ldots, r_N)$$ approximation of higher-order tensors. SIAM J. Matrix Anal. Appl. 21, 1324\u20131342 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR19","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1137\/06066518X","volume":"29","author":"V De Silva","year":"2008","unstructured":"De Silva, V., Lim, L.-H.: Tensor rank and the ill-posedness of the best low-rank approximation problem. SIAM J. Matrix Anal. Appl. 29, 1084\u20131127 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2201-7","volume-title":"Riemannian Geometry","author":"MP do Carmo","year":"1992","unstructured":"do Carmo, M.P.: Riemannian Geometry. Springer, Boston, Birkh\u00e4user (1992)"},{"key":"1867_CR21","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF02288367","volume":"1","author":"C Eckart","year":"1936","unstructured":"Eckart, C., Young, G.: The approximation of one matrix by another of lower rank. Psychometrika 1, 211\u2013218 (1936)","journal-title":"Psychometrika"},{"issue":"2","key":"1867_CR22","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1998","unstructured":"Edelman, A., Arias, T.A., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM. J. Matrix Anal. Appl. 20(2), 303\u2013353 (1998)","journal-title":"SIAM. J. Matrix Anal. Appl."},{"key":"1867_CR23","unstructured":"Franc, A.: Etude Alg\u00e9brique des Multitableaux: Apports de l\u2019Alg\u00e9bre Tensorielle. Th\u00e8se de Doctorat, Sp\u00e9cialit\u00e9 Statistiques, Univ. de Montpellier II, Montpellier, France (1992)"},{"key":"1867_CR24","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. Johns Hopkins University Press, Baltimore, MD (2013)","edition":"4"},{"key":"1867_CR25","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/gamm.201310004","volume":"36","author":"L Grasedyck","year":"2013","unstructured":"Grasedyck, L., Kressner, D., Tobler, C.: A literature survey of low-rank tensor approximation techniques. GAMM-Mitt. 36, 53\u201378 (2013)","journal-title":"GAMM-Mitt."},{"key":"1867_CR26","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1137\/18M1208101","volume":"40","author":"Y Guan","year":"2019","unstructured":"Guan, Y., Chu, D.: Numerical computation for orthogonal low-rank approximation of tensors. SIAM J. Matrix Anal. Appl. 40, 1047\u20131065 (2019)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-28027-6","volume-title":"Tensor Spaces and Numerical Tensor Calculus","author":"W Hackbusch","year":"2012","unstructured":"Hackbusch, W.: Tensor Spaces and Numerical Tensor Calculus. Springer, Berlin (2012)"},{"key":"1867_CR28","volume-title":"Algebraic Geometry. Graduate Texts in Mathematics 52","author":"R Hartshorne","year":"1977","unstructured":"Hartshorne, R.: Algebraic Geometry. Graduate Texts in Mathematics 52. Springer, New York (1977)"},{"key":"1867_CR29","doi-asserted-by":"crossref","first-page":"1160","DOI":"10.1137\/0907079","volume":"7","author":"NJ Higham","year":"1986","unstructured":"Higham, N.J.: Computing the polar decomposition-with applications. SIAM J. Sci. Statist. Comput. 7, 1160\u20131174 (1986)","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"1867_CR30","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"RA Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, New York (1985)"},{"key":"1867_CR31","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1007\/s00211-018-0981-3","volume":"140","author":"S Hu","year":"2018","unstructured":"Hu, S., Li, G.: Convergence rate analysis for the higher order power method in best rank one approximations of tensors. Numer. Math. 140, 993\u20131031 (2018)","journal-title":"Numer. Math."},{"key":"1867_CR32","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1137\/11085743X","volume":"34","author":"M Ishteva","year":"2013","unstructured":"Ishteva, M., Absil, P.-A., Van Dooren, P.: Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors. SIAM J. Matrix Anal. Appl. 34, 651\u2013672 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR33","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/060649070","volume":"29","author":"AV Knyazev","year":"2006","unstructured":"Knyazev, A.V., Argentati, M.E.: Majorization for changes in angles between subspaces, Ritz values, and graph Laplacian spectra. SIAM J. Matrix Anal. Appl. 29, 15\u201332 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR34","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1137\/S0895479800368354","volume":"23","author":"TG Kolda","year":"2001","unstructured":"Kolda, T.G.: Orthogonal tensor decompositions. SIAM J. Matrix Anal. Appl. 23, 243\u2013255 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR35","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1137\/S0895479801394465","volume":"24","author":"TG Kolda","year":"2002","unstructured":"Kolda, T.G.: A counterexample to the possibility of an extension of the Eckart-Young low rank approximation theorem for the orthogonal rank tensor decomposition. SIAM J. Matrix Anal. Appl. 24, 762\u2013767 (2002)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR36","doi-asserted-by":"crossref","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, 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"key":"1867_CR37","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0024-3795(77)90069-6","volume":"18","author":"JB Kruskal","year":"1977","unstructured":"Kruskal, J.B.: Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics. Linear Algebr. Appl. 18, 95\u2013138 (1977)","journal-title":"Linear Algebr. Appl."},{"issue":"3","key":"1867_CR38","doi-asserted-by":"crossref","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Annales de l\u2019Institut Fourier 48(3), 769\u2013783 (1998)","journal-title":"Annales de l\u2019Institut Fourier"},{"key":"1867_CR39","volume-title":"Tensors: Geometry and Applications","author":"JM Landsberg","year":"2012","unstructured":"Landsberg, J.M.: Tensors: Geometry and Applications. AMS, Providence, RI (2012)"},{"key":"1867_CR40","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10107-019-01374-3","volume":"176","author":"JD Lee","year":"2019","unstructured":"Lee, J.D., Panageas, I., Piliouras, G., Simchowitz, M., Jordan, M.I., Recht, B.: First-order methods almost always avoid strict saddle points. Math. Program. 176, 311\u2013337 (2019)","journal-title":"Math. Program."},{"key":"1867_CR41","first-page":"1","volume":"49","author":"JD Lee","year":"2016","unstructured":"Lee, J.D., Simchowitz, M., Jordan, M.I., Recht, B.: Gradient descent only converges to minimizers. P. Mach. Learn. Res. 49, 1\u201312 (2016)","journal-title":"P. Mach. Learn. Res."},{"key":"1867_CR42","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","volume":"18","author":"G Li","year":"2018","unstructured":"Li, G., Pong, T.K.: Calculus of the exponent of Kurdyka-\u0141ojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. 18, 1199\u20131232 (2018)","journal-title":"Found. Comput. Math."},{"key":"1867_CR43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/17M1116295","volume":"39","author":"J Li","year":"2018","unstructured":"Li, J., Usevich, K., Comon, P.: Globally convergent jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization. SIAM J. Matrix Anal. Appl. 39, 1\u201322 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR44","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/j.laa.2019.03.006","volume":"576","author":"J Li","year":"2019","unstructured":"Li, J., Usevich, K., Comon, P.: On approximate diagonalization of third order symmetric tensors by orthogonal transformations. Linear Algebr. Appl. 576, 324\u2013351 (2019)","journal-title":"Linear Algebr. Appl."},{"key":"1867_CR45","unstructured":"Li, J., Usevich, K., Comon, P.: Jacobi-type algorithm for low rank orthogonal approximation of symmetric tensors and its convergence analysis. arXiv: 1911.00659"},{"key":"1867_CR46","doi-asserted-by":"crossref","unstructured":"Lim, L.-H.: Tensors and hypermatrices. Chapter 15 in Handbook of Linear Algebra. In: Hogben, L. (eds.) (2013)","DOI":"10.1201\/b16113-19"},{"key":"1867_CR47","unstructured":"Liu, H., Wu, W., So, A.M.-C.: Quadratic optimization with orthogonality constraints: explicit \u0141ojasiewicz exponent and linear convergence of line-search methods. In: Proceedings of the 33rd International Convergnece on Machine Learning, New York, USA (2016)"},{"key":"1867_CR48","unstructured":"\u0141ojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els, Les \u00c9quations aux D\u00e9riv\u00e9es Partielles. \u00c9ditions du centre National de la Recherche Scientifique, Paris, pp. 87\u201389 (1963)"},{"key":"1867_CR49","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1137\/060655924","volume":"30","author":"CDM Martin","year":"2008","unstructured":"Martin, C.D.M., Van Loan, C.F.: A Jacobi-type method for computing orthogonal tensor decompositions. SIAM J. Matrix Anal. Appl. 30, 1219\u20131232 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR50","volume-title":"Tensor Methods in Statistics","author":"P McCullagh","year":"1987","unstructured":"McCullagh, P.: Tensor Methods in Statistics. Chapman and Hall, London (1987)"},{"key":"1867_CR51","doi-asserted-by":"crossref","unstructured":"Milnor, J.: Morse Theory. Annals Math. Studies, 51. Princeton Univ. Press, Princeton, NJ (1963)","DOI":"10.1515\/9781400881802"},{"key":"1867_CR52","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1016\/j.laa.2011.04.019","volume":"438","author":"MJ Mohlenkamp","year":"2013","unstructured":"Mohlenkamp, M.J.: Musings on multilinear fitting. Linear Algebr. Appl. 438, 834\u2013852 (2013)","journal-title":"Linear Algebr. Appl."},{"key":"1867_CR53","doi-asserted-by":"crossref","first-page":"1638","DOI":"10.1137\/15M1010890","volume":"36","author":"C Mu","year":"2015","unstructured":"Mu, C., Hsu, D., Goldfarb, D.: Successive rank-one approximations for nearly orthogonally decomposable symmetric tensors. SIAM J. Matrix Anal. Appl. 36, 1638\u20131659 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR54","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization-A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization-A Basic Course. Kluwer Academic Publishers, London (2004)"},{"key":"1867_CR55","doi-asserted-by":"crossref","unstructured":"Qi, L., Luo, Z.: Tensor Analysis: Spectral Theory and Special Tensors. SIAM (2017)","DOI":"10.1137\/1.9781611974751"},{"key":"1867_CR56","volume-title":"Variational Analysis. Grundlehren der Mathematischen Wissenschaften","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.: Variational Analysis. Grundlehren der Mathematischen Wissenschaften, vol. 317. Springer, Berlin (1998)"},{"key":"1867_CR57","volume-title":"Basic Algebraic Geometry","author":"IR Shafarevich","year":"1977","unstructured":"Shafarevich, I.R.: Basic Algebraic Geometry. Springer-Verlag, Berlin (1977)"},{"key":"1867_CR58","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1137\/110830034","volume":"33","author":"M S\u00f8rensen","year":"2012","unstructured":"S\u00f8rensen, M., De Lathauwer, L., Comon, P., Jcart, S., Deneire, L.: Canonical polyadic decomposition with a columnwise orthonormal factor matrix. SIAM J. Matrix Anal. Appl. 33, 1190\u20131213 (2012)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR59","first-page":"262","volume":"11","author":"J Sun","year":"1989","unstructured":"Sun, J., Chen, C.: Generalized polar decomposition. Math. Numer. Sinica 11, 262\u2013273 (1989)","journal-title":"Math. Numer. Sinica"},{"key":"1867_CR60","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1137\/110843587","volume":"33","author":"A Uschmajew","year":"2012","unstructured":"Uschmajew, A.: Local convergence of the alternating least squares algorithm for canonical tensor approximation. SIAM J. Matrix Anal. Appl. 33, 639\u2013652 (2012)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR61","first-page":"309","volume":"11","author":"A Uschmajew","year":"2015","unstructured":"Uschmajew, A.: A new convergence proof for the high-order power method and generalizations. Pacific J. Optim. 11, 309\u2013321 (2015)","journal-title":"Pacific J. Optim."},{"key":"1867_CR62","doi-asserted-by":"crossref","first-page":"2998","DOI":"10.1137\/19M125950X","volume":"30","author":"K Usevich","year":"2020","unstructured":"Usevich, K., Li, J., Comon, P.: Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms. SIAM J. Optim. 30, 2998\u20133028 (2020)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1867_CR63","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1137\/130938207","volume":"35","author":"L Wang","year":"2014","unstructured":"Wang, L., Chu, M.T.: On the global convergence of the alternating least squares method for rank-one tensor approximation. SIAM J. Matrix Anal. Appl. 35(3), 1058\u20131072 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR64","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/130943133","volume":"36","author":"L Wang","year":"2015","unstructured":"Wang, L., Chu, M.T., Yu, B.: Orthogonal low rank tensor approximation: alternating least squares method and its global convergence. SIAM J. Matrix Anal. Appl. 36, 1\u201319 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR65","doi-asserted-by":"crossref","first-page":"1797","DOI":"10.1137\/19M1303113","volume":"41","author":"Y Yang","year":"2020","unstructured":"Yang, Y.: The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence. SIAM J. Matrix Anal. Appl. 41, 1797\u20131825 (2020)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1867_CR66","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1137\/S0895479899352045","volume":"23","author":"T Zhang","year":"2001","unstructured":"Zhang, T., Golub, G.H.: Rank-one approximation to high order tensors. SIAM J. Matrix Anal. Appl. 23, 534\u2013550 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01867-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01867-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01867-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,21]],"date-time":"2023-04-21T17:36:54Z","timestamp":1682098614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01867-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,30]]},"references-count":66,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1867"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01867-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,30]]},"assertion":[{"value":"28 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}