{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T18:42:54Z","timestamp":1778611374246,"version":"3.51.4"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T00:00:00Z","timestamp":1467158400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Japan Science and Technology Agency (JP)"},{"name":"JSPS Scientific Research Grants","award":["26870149"],"award-info":[{"award-number":["26870149"]}]},{"name":"JSPS Scientific Research Grants","award":["26540007"],"award-info":[{"award-number":["26540007"]}]},{"name":"JSPS Grant-in-Aid for JSPS Fellows","award":["267749"],"award-info":[{"award-number":["267749"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10107-016-1042-2","type":"journal-article","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T19:58:13Z","timestamp":1467230293000},"page":"325-361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Finding a low-rank basis in a matrix subspace"],"prefix":"10.1007","volume":"162","author":[{"given":"Yuji","family":"Nakatsukasa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9519-2487","authenticated-orcid":false,"given":"Tasuku","family":"Soma","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Uschmajew","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,29]]},"reference":[{"issue":"6","key":"1042_CR1","doi-asserted-by":"crossref","first-page":"2921","DOI":"10.1109\/TIP.2012.2187530","volume":"21","author":"V Abolghasemi","year":"2012","unstructured":"Abolghasemi, V., Ferdowsi, S., Sanei, S.: Blind separation of image sources via adaptive dictionary learning. IEEE Trans. Image Process. 21(6), 2921\u20132930 (2012)","journal-title":"IEEE Trans. Image Process."},{"issue":"1 Ser. B","key":"1042_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10107-011-0459-x","volume":"129","author":"BPW Ames","year":"2011","unstructured":"Ames, B.P.W., Vavasis, S.A.: Nuclear norm minimization for the planted clique and biclique problems. Math. Program. 129(1 Ser. B), 69\u201389 (2011)","journal-title":"Math. Program."},{"issue":"3","key":"1042_CR3","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s00365-013-9213-3","volume":"38","author":"F Andersson","year":"2013","unstructured":"Andersson, F., Carlsson, M.: Alternating projections on nontangential manifolds. Constr. Approx. 38(3), 489\u2013525 (2013)","journal-title":"Constr. Approx."},{"key":"1042_CR4","doi-asserted-by":"crossref","unstructured":"Bai, Z., Demmel, J., Dongarra, J., Ruhe, A., van der Vorst, H. (eds.): Templates for the solution of algebraic eigenvalue problems. A practical guide. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (2000)","DOI":"10.1137\/1.9780898719581"},{"key":"1042_CR5","doi-asserted-by":"crossref","unstructured":"Barak, B., Kelner, J.A., Steurer, D.: Rounding sum-of-squares relaxations. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 31\u201340 (2014)","DOI":"10.1145\/2591796.2591886"},{"issue":"6","key":"1042_CR6","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1162\/neco.1995.7.6.1129","volume":"7","author":"AJ Bell","year":"1995","unstructured":"Bell, A.J., Sejnowski, T.J.: An information-maximization approach to blind separation and blind deconvolution. Neural Comput. 7(6), 1129\u20131159 (1995)","journal-title":"Neural Comput."},{"key":"1042_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-20192-9","volume-title":"Statistics for High-Dimensional Data. Methods, Theory and Applications","author":"P B\u00fchlmann","year":"2011","unstructured":"B\u00fchlmann, P., van de Geer, S.: Statistics for High-Dimensional Data. Methods, Theory and Applications. Springer, Heidelberg (2011)"},{"issue":"4","key":"1042_CR8","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"issue":"9\u201310","key":"1042_CR9","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.crma.2008.03.014","volume":"346","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J.: The restricted isometry property and its implications for compressed sensing. C. R. Math. Acad. Sci. Paris 346(9\u201310), 589\u2013592 (2008)","journal-title":"C. R. Math. Acad. Sci. Paris"},{"issue":"6","key":"1042_CR10","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"issue":"12","key":"1042_CR11","doi-asserted-by":"crossref","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"EJ Candes","year":"2006","unstructured":"Candes, E.J., Tao, T.: Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inform. Theory 52(12), 5406\u20135425 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"1042_CR12","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inform. Theory 56(5), 2053\u20132080 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"1042_CR13","doi-asserted-by":"crossref","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\u201d decomposition. Psychometrika 35(3), 283\u2013319 (1970)","journal-title":"Psychometrika"},{"issue":"2","key":"1042_CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/MSP.2013.2297439","volume":"32","author":"A Cichocki","year":"2015","unstructured":"Cichocki, A., Mandic, D., De Lathauwer, L., Zhou, G., Zhao, Q., Caiafa, C., Phan, H.A.: Tensor decompositions for signal processing applications: from two-way to multiway component analysis. IEEE Signal Proc. Mag. 32(2), 145\u2013163 (2015)","journal-title":"IEEE Signal Proc. Mag."},{"issue":"4","key":"1042_CR15","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1137\/0607059","volume":"7","author":"TF Coleman","year":"1986","unstructured":"Coleman, T.F., Pothen, A.: The null space problem. I. Complexity. SIAM J. Algebraic Discrete Methods 7(4), 527\u2013537 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"3","key":"1042_CR16","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1137\/040608830","volume":"28","author":"L Lathauwer De","year":"2006","unstructured":"De Lathauwer, L.: A link between the canonical decomposition in multilinear algebra and simultaneous matrix diagonalization. SIAM J. Matrix Anal. Appl. 28(3), 642\u2013666 (2006). (electronic)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"1042_CR17","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1137\/070690729","volume":"30","author":"L Lathauwer De","year":"2008","unstructured":"De Lathauwer, L.: Decompositions of a higher-order tensor in block terms. II. Definitions and uniqueness. SIAM J. Matrix Anal. Appl. 30(3), 1033\u20131066 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"1042_CR18","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/S0895479896305696","volume":"21","author":"L Lathauwer De","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). (electronic)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1042_CR19","doi-asserted-by":"crossref","unstructured":"De\u00a0Lathauwer, L., De\u00a0Moor, B., Vandewalle, J.: Computation of the canonical decomposition by means of a simultaneous generalized Schur decomposition. SIAM J. Matrix Anal. Appl. 26(2), 295\u2013327 (electronic) (2004\/2015)","DOI":"10.1137\/S089547980139786X"},{"issue":"4","key":"1042_CR20","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1093\/imaiai\/iau007","volume":"3","author":"L Demanet","year":"2014","unstructured":"Demanet, L., Hand, P.: Scaling law for recovering the sparsest element in a subspace. Inf. Inference 3(4), 295\u2013309 (2014)","journal-title":"Inf. Inference"},{"key":"1042_CR21","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971446","volume-title":"Applied Numerical Linear Algebra","author":"JW Demmel","year":"1997","unstructured":"Demmel, J.W.: Applied Numerical Linear Algebra. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1997)"},{"issue":"2","key":"1042_CR22","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1137\/130916084","volume":"35","author":"I Domanov","year":"2014","unstructured":"Domanov, I., De Lathauwer, L.: Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition. SIAM J. Matrix Anal. Appl. 35(2), 636\u2013660 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"6","key":"1042_CR23","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1007\/s10208-015-9279-3","volume":"15","author":"D Drusvyatskiy","year":"2015","unstructured":"Drusvyatskiy, D., Ioffe, A.D., Lewis, A.S.: Transversality and alternating projections for nonconvex sets. Found. Comput. Math. 15(6), 1637\u20131651 (2015)","journal-title":"Found. Comput. Math."},{"key":"1042_CR24","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71B","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Systems of distinct representatives and linear algebra. J. Res. Nat. Bur. Stand. Sect. B 71B, 241\u2013245 (1967)","journal-title":"J. Res. Nat. Bur. Stand. Sect. B"},{"key":"1042_CR25","unstructured":"Fazel, M.: Matrix rank minimization with applications. Ph.D. thesis, Electrical Engineering Deptartment Stanford University (2002)"},{"key":"1042_CR26","doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H., Boyd, S.P.: A rank minimization heuristic with application to minimum order system approximation. In: Proceedings of the 2001 American Control Conference, pp. 4734\u20134739 (2001)","DOI":"10.1109\/ACC.2001.945730"},{"key":"1042_CR27","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. Johns Hopkins University Press, Baltimore, MD (2013)"},{"key":"1042_CR28","unstructured":"Grant, M., Boyd, S.: CVX: Matlab Software for Disciplined Convex Programming, version 2.1, March 2014. http:\/\/cvxr.com\/cvx"},{"issue":"3","key":"1042_CR29","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.jcss.2004.06.003","volume":"69","author":"L Gurvits","year":"2004","unstructured":"Gurvits, L.: Classical complexity and quantum entanglement. J. Comput. Syst. Sci. 69(3), 448\u2013484 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"1042_CR30","unstructured":"Harshman, R.A.: Foundations of the PARAFAC procedure: models and conditions for an \u201cexplanatory\u201d multi-modal factor analysis. UCLA Working Papers in Phonetics 16, 1\u201384 (1970)"},{"key":"1042_CR31","unstructured":"Harvey, N.J.A., Karger, D.R., Murota, K.: Deterministic network coding by matrix completion. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 489\u2013498 (2005)"},{"key":"1042_CR32","doi-asserted-by":"crossref","unstructured":"Harvey, N. J.\u00a0A., Karger, D.\u00a0R., Yekhanin, S.: The complexity of matrix completion. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 1103\u20131111 (2006)","DOI":"10.1145\/1109557.1109679"},{"issue":"4","key":"1042_CR33","doi-asserted-by":"crossref","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"},{"key":"1042_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0024-3795(93)00070-G","volume":"215","author":"U Helmke","year":"1995","unstructured":"Helmke, U., Shayman, M.A.: Critical points of matrix least squares distance functions. Linear Algebra Appl. 215, 1\u201319 (1995)","journal-title":"Linear Algebra Appl."},{"key":"1042_CR35","doi-asserted-by":"crossref","unstructured":"Hillar, C.J., Lim, L.-H.: Most tensor problems are NP-hard. J. ACM 60(6), Art. 45, 39 (2013)","DOI":"10.1145\/2512329"},{"key":"1042_CR36","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1002\/sapm192761164","volume":"6","author":"FL Hitchcock","year":"1927","unstructured":"Hitchcock, F.L.: The expression of a tensor or a polyadic as a sum of products. J. Math. Phys. 6, 164\u2013189 (1927)","journal-title":"J. Math. Phys."},{"key":"1042_CR37","unstructured":"Huang, G.B., Ramesh, M., Berg, T., Learned-Miller, E.: Labeled faces in the wild: a database for studying face recognition in unconstrained environments. Technical report 07-49, University of Massachusetts, Amherst (2007)"},{"key":"1042_CR38","unstructured":"Ivanyos, G., Karpinski, M., Qiao, Y., Santha, M.: Generalized Wong sequences and their applications to Edmonds\u2019 problems. In: Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science, vol. 117543, pp. 397\u2013408 (2014)"},{"issue":"3","key":"1042_CR39","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1002\/nla.1875","volume":"21","author":"S Kindermann","year":"2014","unstructured":"Kindermann, S., Navasca, C.: News algorithms for tensor decomposition based on a reduced functional. Numer. Linear Algebra Appl. 21(3), 340\u2013374 (2014)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"3","key":"1042_CR40","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(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"issue":"4","key":"1042_CR41","doi-asserted-by":"crossref","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)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"1042_CR42","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s10208-008-9036-y","volume":"9","author":"AS Lewis","year":"2009","unstructured":"Lewis, A.S., Luke, D.R., Malick, J.: Local linear convergence for alternating and averaged nonconvex projections. Found. Comput. Math. 9(4), 485\u2013513 (2009)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"1042_CR43","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1287\/moor.1070.0291","volume":"33","author":"AS Lewis","year":"2008","unstructured":"Lewis, A.S., Malick, J.: Alternating projections on manifolds. Math. Oper. Res. 33(1), 216\u2013234 (2008)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1042_CR44","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1016\/j.laa.2011.12.002","volume":"438","author":"N Li","year":"2013","unstructured":"Li, N., Kindermann, S., Navasca, C.: Some convergence results on the regularized alternating least-squares method for tensor decomposition. Linear Algebra Appl. 438(2), 796\u2013812 (2013)","journal-title":"Linear Algebra Appl."},{"issue":"1\u2014-2, Ser. A","key":"1042_CR45","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10107-010-0437-8","volume":"133","author":"Y-J Liu","year":"2012","unstructured":"Liu, Y.-J., Sun, D., Toh, K.-C.: An implementable proximal point algorithmic framework for nuclear norm minimization. Math. Program. 133(1\u2014-2, Ser. A), 399\u2013436 (2012)","journal-title":"Math. Program."},{"issue":"3","key":"1042_CR46","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1137\/090755436","volume":"31","author":"Z Liu","year":"2009","unstructured":"Liu, Z., Vandenberghe, L.: Interior-point method for nuclear norm approximation with application to system identification. SIAM J. Matrix Anal. Appl. 31(3), 1235\u20131256 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1042_CR47","unstructured":"Lov\u00e1sz, L.: Singular spaces of matrices and their application in combinatorics. Bol. Soc. Brasil. Math. 20(1), 87\u201399 (1989)"},{"issue":"2","key":"1042_CR48","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 Algebra Appl. 438(2), 834\u2013852 (2013)","journal-title":"Linear Algebra Appl."},{"key":"1042_CR49","volume-title":"Randomized Algorithms","author":"R Motwani","year":"2010","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Chapman and Hall\/CRC, Routledge (2010)"},{"issue":"2","key":"1042_CR50","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10208-015-9253-0","volume":"16","author":"D Noll","year":"2016","unstructured":"Noll, D., Rondepierre, A.: On local convergence of the method of alternating projections. Found. Comput. Math. 16(2), 425\u2013455 (2016)","journal-title":"Found. Comput. Math."},{"key":"1042_CR51","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1017\/CBO9780511662041.004","volume-title":"Matroid Applications","author":"J Oxley","year":"1992","unstructured":"Oxley, J.: Infinite matroids. In: White, N. (ed.) Matroid Applications, pp. 73\u201390. Cambridge University Press, Cambridge (1992)"},{"key":"1042_CR52","first-page":"3401","volume-title":"Advances in Neural Information Processing Systems","author":"Q Qu","year":"2014","unstructured":"Qu, Q., Sun, J., Wright, J.: Finding a sparse vector in a subspace: linear sparsity using alternating directions. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N., Weinberger, K. (eds.) Advances in Neural Information Processing Systems, pp. 3401\u20133409. Curran Associates, Inc, Red Hook (2014)"},{"key":"1042_CR53","unstructured":"Qu, Q., Sun, J., Wright, J.: Finding a sparse vector in a subspace: linear sparsity using alternating directions. arXiv:1412.4659 (2014)"},{"key":"1042_CR54","first-page":"3413","volume":"12","author":"B Recht","year":"2011","unstructured":"Recht, B.: A simpler approach to matrix completion. J. Mach. Learn. Res. 12, 3413\u20133430 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"1042_CR55","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"1042_CR56","unstructured":"Sorber, L., Van Barel, M., De Lathauwer, L.: Tensorlab v2.0. http:\/\/www.tensorlab.net\/"},{"key":"1042_CR57","unstructured":"Spielman, D.A., Wang, H., Wright, J.: Exact recovery of sparsely-used dictionaries. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI \u201913, pp. 3087\u20133090. AAAI Press (2013)"},{"key":"1042_CR58","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718058","volume-title":"Matrix Algorithms. Vol. II","author":"GW Stewart","year":"2001","unstructured":"Stewart, G.W.: Matrix Algorithms. Vol. II. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2001)"},{"key":"1042_CR59","volume-title":"Matrix Perturbation Theory. Computer Science and Scientific Computing","author":"GW Stewart","year":"1990","unstructured":"Stewart, G.W., Sun, J.G.: Matrix Perturbation Theory. Computer Science and Scientific Computing. Academic Press, Inc., Boston, MA (1990)"},{"key":"1042_CR60","doi-asserted-by":"crossref","unstructured":"Sun, J., Qu, Q., Wright, J.: Complete dictionary recovery over the sphere I: Overview and the geometric picture. arXiv:1511.03607 (2015)","DOI":"10.1109\/SAMPTA.2015.7148922"},{"key":"1042_CR61","doi-asserted-by":"crossref","unstructured":"Sun, J., Qu, Q., Wright, J.: Complete dictionary recovery over the sphere II: Recovery by Riemannian trust-region method. arXiv:1511.04777 (2015)","DOI":"10.1109\/SAMPTA.2015.7148922"},{"issue":"2","key":"1042_CR62","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(2), 639\u2013652 (2012)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"1042_CR63","first-page":"309","volume":"11","author":"A Uschmajew","year":"2015","unstructured":"Uschmajew, A.: A new convergence proof for the higher-order power method and generalizations. Pac. J. Optim. 11(2), 309\u2013321 (2015)","journal-title":"Pac. J. Optim."},{"issue":"3","key":"1042_CR64","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 approximation to generic tensors. SIAM J. Matrix Anal. Appl. 35(3), 1058\u20131072 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1042_CR65","doi-asserted-by":"crossref","unstructured":"Wedin, P.-\u00c5.: Perturbation bounds in connection with singular value decomposition. Nordisk Tidskr. Informationsbehandling (BIT) 12, 99\u2013111 (1972)","DOI":"10.1007\/BF01932678"},{"issue":"3","key":"1042_CR66","doi-asserted-by":"crossref","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Yin, W.: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imaging Sci. 6(3), 1758\u20131789 (2013)","journal-title":"SIAM J. Imaging Sci."},{"key":"1042_CR67","doi-asserted-by":"crossref","unstructured":"Zhao, X., Zhou, G., Dai, W., Xu, T., Wang, W.: Joint image separation and dictionary learning. In: 18th International Conference on Digital Signal Processing (DSP), pp. 1\u20136. IEEE (2013)","DOI":"10.1109\/ICDSP.2013.6622730"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1042-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1042-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1042-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1042-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T23:14:05Z","timestamp":1748992445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1042-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,29]]},"references-count":67,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1042"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1042-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,29]]}}}