{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:20:36Z","timestamp":1758817236051},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T00:00:00Z","timestamp":1669161600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T00:00:00Z","timestamp":1669161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10915-022-02054-9","type":"journal-article","created":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T16:14:44Z","timestamp":1669306484000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Rank Properties and Computational Methods for Orthogonal Tensor Decompositions"],"prefix":"10.1007","volume":"94","author":[{"given":"Chao","family":"Zeng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,23]]},"reference":[{"issue":"2","key":"2054_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/cem.1335","volume":"25","author":"E Acar","year":"2011","unstructured":"Acar, E., Dunlavy, D.M., Kolda, T.G.: A scalable optimization approach for fitting canonical tensor decompositions. J. Chemom. 25(2), 67\u201386 (2011)","journal-title":"J. Chemom."},{"key":"2054_CR2","unstructured":"Bader, B.W., Kolda, T.G. et al.: MATLAB Tensor Toolbox Version 3.0-dev. Available online, Oct. (2017)"},{"key":"2054_CR3","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic press, Cambridge (1982)"},{"issue":"3","key":"2054_CR4","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 \u201cEckart-Young\u2019\u2019 decomposition. Psychometrika 35(3), 283\u2013319 (1970)","journal-title":"Psychometrika"},{"issue":"4","key":"2054_CR5","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1137\/070711621","volume":"30","author":"J Chen","year":"2008","unstructured":"Chen, J., Saad, Y.: On the tensor SVD and the optimal low rank orthogonal approximation of tensors. SIAM J. Matrix Anal. Appl. 30(4), 1709\u20131734 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2054_CR6","doi-asserted-by":"publisher","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(3), 287\u2013314 (1994)","journal-title":"Signal Process."},{"issue":"3","key":"2054_CR7","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/S1052623493251463","volume":"6","author":"AR Conn","year":"1996","unstructured":"Conn, A.R., Gould, N., Sartenaer, A., Toint, P.L.: Convergence properties of an augmented Lagrangian algorithm for optimization with a combination of general equality and linear constraints. SIAM J. Optim. 6(3), 674\u2013703 (1996)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2054_CR8","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0895479896305696","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21(4), 1253\u20131278 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2054_CR9","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/06066518X","volume":"30","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. 30(3), 1084\u20131127 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"6","key":"2054_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2202","volume":"25","author":"H De Sterck","year":"2018","unstructured":"De Sterck, H., Howse, A.J.: Nonlinearly preconditioned L-BFGS as an acceleration mechanism for alternating least squares with application to tensor decomposition. Num. Linear Algebra Appl. 25(6), e2202 (2018)","journal-title":"Num. Linear Algebra Appl."},{"issue":"3","key":"2054_CR11","doi-asserted-by":"publisher","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(3), 211\u2013218 (1936)","journal-title":"Psychometrika"},{"issue":"3","key":"2054_CR12","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s00211-012-0465-9","volume":"122","author":"M Espig","year":"2012","unstructured":"Espig, M., Hackbusch, W.: A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format. Numer. Math. 122(3), 489\u2013525 (2012)","journal-title":"Numer. Math."},{"issue":"3","key":"2054_CR13","doi-asserted-by":"publisher","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(3), 1047\u20131065 (2019)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2054_CR14","unstructured":"Harshman, R.A. et al.: Foundations of the PARAFAC procedure: models and conditions for an \u201cexplanatory\u201d multimodal factor analysis. (1970)"},{"issue":"4","key":"2054_CR15","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/0196-6774(90)90014-6","volume":"11","author":"J H\u00e5stad","year":"1990","unstructured":"H\u00e5stad, J.: Tensor rank is NP-complete. J. Algorithms 11(4), 644\u2013654 (1990)","journal-title":"J. Algorithms"},{"issue":"6","key":"2054_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/2512329","volume":"60","author":"CJ Hillar","year":"2013","unstructured":"Hillar, C.J., Lim, L.-H.: Most tensor problems are NP-hard. J. ACM (JACM) 60(6), 45 (2013)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"2054_CR17","doi-asserted-by":"publisher","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(1), 243\u2013255 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2054_CR18","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0895479801394465","volume":"24","author":"TG Kolda","year":"2003","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(3), 762\u2013767 (2003)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2054_CR19","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)","journal-title":"SIAM Rev."},{"issue":"3","key":"2054_CR20","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s11336-008-9056-1","volume":"73","author":"WP Krijnen","year":"2008","unstructured":"Krijnen, W.P., Dijkstra, T.K., Stegeman, A.: On the non-existence of optimal solutions and the occurrence of \u201cdegeneracy\u2019\u2019 in the CANDECOMP\/PARAFAC model. Psychometrika 73(3), 431\u2013439 (2008)","journal-title":"Psychometrika"},{"issue":"2","key":"2054_CR21","doi-asserted-by":"publisher","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 Algebra Appl. 18(2), 95\u2013138 (1977)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2054_CR22","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/17M1144349","volume":"39","author":"Z Li","year":"2018","unstructured":"Li, Z., Nakatsukasa, Y., Soma, T., Uschmajew, A.: On orthogonal tensors and best rank-one approximation ratio. SIAM J. Matrix Anal. Appl. 39(1), 400\u2013425 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2054_CR23","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1109\/TIT.2013.2291876","volume":"60","author":"L-H Lim","year":"2013","unstructured":"Lim, L.-H., Comon, P.: Blind multilinear identification. IEEE Trans. Inf. Theory 60(2), 1260\u20131280 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2054_CR24","doi-asserted-by":"publisher","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(3), 1219\u20131232 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2054_CR25","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1145\/192115.192132","volume":"20","author":"JJ More","year":"1994","unstructured":"More, J.J., Thuente, D.J.: Line search algorithms with guaranteed sufficient decrease. ACM Trans. Math. Softw. 20(3), 286\u2013307 (1994)","journal-title":"ACM Trans. Math. Softw."},{"key":"2054_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2020.107472","volume":"171","author":"M Nazih","year":"2020","unstructured":"Nazih, M., Minaoui, K., Comon, P.: Using the proximal gradient and the accelerated proximal gradient as a canonical polyadic tensor decomposition algorithms in difficult situations. Signal Process. 171, 107472 (2020)","journal-title":"Signal Process."},{"key":"2054_CR27","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer Science & Business Media, New York (2006)"},{"key":"2054_CR28","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer Science & Business Media, New York (2009)"},{"issue":"4","key":"2054_CR29","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1109\/SURV.2011.082911.00067","volume":"14","author":"P Seeling","year":"2011","unstructured":"Seeling, P., Reisslein, M.: Video transport evaluation with H. 264 video traces. IEEE Commun. Surv. Tutor. 14(4), 1142\u20131165 (2011)","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"3","key":"2054_CR30","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/1099-128X(200005\/06)14:3<229::AID-CEM587>3.0.CO;2-N","volume":"14","author":"ND Sidiropoulos","year":"2000","unstructured":"Sidiropoulos, N.D., Bro, R.: On the uniqueness of multilinear decomposition of N-way arrays. J. Chemometr. J. Chemometr. Soc. 14(3), 229\u2013239 (2000)","journal-title":"J. Chemometr. J. Chemometr. Soc."},{"issue":"4","key":"2054_CR31","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/110830034","volume":"33","author":"M S\u00f8rensen","year":"2012","unstructured":"S\u00f8rensen, M., De Lathauwer, L., Comon, P., Icart, S., Deneire, L.: Canonical polyadic decomposition with a columnwise orthonormal factor matrix. SIAM J. Matrix Anal. Appl. 33(4), 1190\u20131213 (2012)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2054_CR32","doi-asserted-by":"publisher","first-page":"A1351","DOI":"10.1137\/110835530","volume":"34","author":"HD Sterck","year":"2012","unstructured":"Sterck, H.D.: A nonlinear GMRES optimization algorithm for canonical tensor decomposition. SIAM J. Sci. Comput. 34(3), A1351\u2013A1379 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"2054_CR33","volume-title":"Optimization Theory and Methods: Nonlinear Programming. Springer Optimization and Its Applications","author":"W Sun","year":"2010","unstructured":"Sun, W., Yuan, Y.-X.: Optimization Theory and Methods: Nonlinear Programming. Springer Optimization and Its Applications. Springer Science & Business Media, New York (2010)"},{"issue":"1","key":"2054_CR34","doi-asserted-by":"publisher","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), 1\u201319 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"2054_CR35","doi-asserted-by":"publisher","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(4), 1797\u20131825 (2020)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"12","key":"2054_CR36","doi-asserted-by":"publisher","first-page":"5412","DOI":"10.1109\/TIP.2014.2363423","volume":"23","author":"F Zhu","year":"2014","unstructured":"Zhu, F., Wang, Y., Fan, B., Xiang, S., Meng, G., Pan, C.: Spectral unmixing via data-guided sparsity. IEEE Trans. Image Process. 23(12), 5412\u20135427 (2014)","journal-title":"IEEE Trans. Image Process."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-02054-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-022-02054-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-02054-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T21:04:58Z","timestamp":1673384698000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-022-02054-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,23]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["2054"],"URL":"https:\/\/doi.org\/10.1007\/s10915-022-02054-9","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,23]]},"assertion":[{"value":"4 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares he\/she has no financial interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"6"}}