{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T02:44:43Z","timestamp":1782441883183,"version":"3.54.5"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,6,9]],"date-time":"2015-06-09T00:00:00Z","timestamp":1433808000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10208-015-9269-5","type":"journal-article","created":{"date-parts":[[2015,6,8]],"date-time":"2015-06-08T17:50:30Z","timestamp":1433785830000},"page":"1031-1068","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":166,"title":["On Tensor Completion via Nuclear Norm Minimization"],"prefix":"10.1007","volume":"16","author":[{"given":"Ming","family":"Yuan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cun-Hui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,6,9]]},"reference":[{"key":"9269_CR1","doi-asserted-by":"crossref","unstructured":"E.J. Cand\u00e8s and B. Recht, Exact matrix completion via convex optimization, Foundations of Computational Mathematics, 9, 717\u2013772 (2008).","DOI":"10.1007\/s10208-009-9045-5"},{"key":"9269_CR2","doi-asserted-by":"crossref","unstructured":"E.J. Cand\u00e8s and T. Tao, The power of convex relaxation: Near-optimal matrix completion, IEEE Transactions on Information Theory, 56(5), 2053\u20132080 (2009).","DOI":"10.1109\/TIT.2010.2044061"},{"key":"9269_CR3","unstructured":"S. Cohen and M. Collins, Tensor decomposition for fast parsing with latent-variable pcfgs, in Proceedings of NIPS 2012 (2012)."},{"key":"9269_CR4","doi-asserted-by":"crossref","unstructured":"S. Gandy, B. Recht and I. Yamada, Tensor completion and low-n-rank tensor recovery via convex optimization, Inverse Problems, 27(2), 025010 (2011).","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"9269_CR5","doi-asserted-by":"crossref","unstructured":"E. Gin\u00e9 and J. Zinn, Some limit theorems for empirical processes, The Annals of Probability, 12(4), 929\u2013989 (1984).","DOI":"10.1214\/aop\/1176993138"},{"key":"9269_CR6","doi-asserted-by":"crossref","unstructured":"D. Gross, Recovering low-rank matrices from few coefficients in any basis, IEEE Transaction on Information Theory, 57, 1548\u20131566 (2011).","DOI":"10.1109\/TIT.2011.2104999"},{"key":"9269_CR7","doi-asserted-by":"crossref","unstructured":"C. Hillar and L.H. Lim, Most tensor problems are NP-hard, Journal of the ACM, 60(6), Art. 45 (2013).","DOI":"10.1145\/2512329"},{"key":"9269_CR8","doi-asserted-by":"crossref","unstructured":"T.G. Kolda and B.W. Bader, Tensor decompositions and applications, SIAM Review, 51(3), 455\u2013500 (2009).","DOI":"10.1137\/07070111X"},{"key":"9269_CR9","unstructured":"J.B. Kruskal, Rank, decomposition, and uniqueness for 3-way and N-way arrays, in \u201cMultiway data analysis\u201d, North-Holland, Amsterdam, pp. 7\u201318 (1989)."},{"key":"9269_CR10","doi-asserted-by":"crossref","unstructured":"N. Li and B. Li, Tensor completion for on-board compression of hyperspectral images, In Image Processing (ICIP), 2010 17th IEEE International Conference on, 517\u2013520 (2010).","DOI":"10.1109\/ICIP.2010.5651225"},{"key":"9269_CR11","doi-asserted-by":"crossref","unstructured":"J. Liu, P. Musialski, P. Wonka and J. Ye, Tensor completion for estimating missing values in visual data, In ICCV, 2114\u20132121 (2009).","DOI":"10.1109\/ICCV.2009.5459463"},{"key":"9269_CR12","doi-asserted-by":"crossref","unstructured":"N. Mesgarani, M. Slaney and S. Shamma, Content-based audio classification based on multiscale spectro-temporal features, IEEE Transactions on Speech and Audio Processing, 14(3), 920\u2013930 (2006).","DOI":"10.1109\/TSA.2005.858055"},{"key":"9269_CR13","unstructured":"C. Mu, B. Huang, J. Wright and D. Goldfarb, Square deal: lower bounds and improved relaxations for tensor recovery, arXiv: 1307.5870 (2013)."},{"key":"9269_CR14","unstructured":"B. Recht, A simpler approach to matrix completion, Journal of Machine Learning Research, 12, 3413\u20133430 (2011)."},{"key":"9269_CR15","doi-asserted-by":"crossref","unstructured":"O. Semerci, N. Hao, M. Kilmer and E. Miller, Tensor based formulation and nuclear norm regularizatin for multienergy computed tomography, IEEE Transactions on Image Processing, 23(4), 1678\u20131693 (2014).","DOI":"10.1109\/TIP.2014.2305840"},{"key":"9269_CR16","doi-asserted-by":"crossref","unstructured":"N.D. Sidiropoulos and N. Nion, Tensor algebra and multi-dimensional harmonic retrieval in signal processing for mimo radar, IEEE Trans. on Signal Processing, 58(11), 5693\u20135705 (2010).","DOI":"10.1109\/TSP.2010.2058802"},{"key":"9269_CR17","unstructured":"M. Signoretto, L. De Lathauwer and J. Suykens, Nuclear norms for tensors and their use for convex multilinear estimation (2010). Preprint at ftp:\/\/ftp.esat.kuleuven.be\/SISTA\/signoretto\/Signoretto_nucTensors ."},{"key":"9269_CR18","doi-asserted-by":"crossref","unstructured":"M. Signoretto, R. Van de Plas, B. De Moor and J. Suykens, Tensor versus matrix completion: A comparison with application to spectral data, IEEE SPL, 18(7), 403\u2013406 (2011).","DOI":"10.1109\/LSP.2011.2151856"},{"key":"9269_CR19","unstructured":"R. Tomioka, K. Hayashi and H. Kashima, Estimation of low-rank tensors via convex optimization, arXiv preprint arXiv:1010.0789 (2010)."},{"key":"9269_CR20","unstructured":"R. Tomioka, T. Suzuki, K. Hayashi and H. Kashima, Statistical performance of convex tensor decomposition, Advances in Neural Information Processing Systems (NIPS), 137 (2011)."},{"key":"9269_CR21","doi-asserted-by":"crossref","unstructured":"J. Tropp, User-friendly tail bounds for sums of random matrices, Foundations of Computational Mathematics, 12, 389\u2013434 (2012).","DOI":"10.1007\/s10208-011-9099-z"},{"key":"9269_CR22","doi-asserted-by":"crossref","unstructured":"G. A. Watson, Characterization of the subdifferential of some matrix norms, Linear Algebra Appl., 170, 33\u201345 (1992).","DOI":"10.1016\/0024-3795(92)90407-2"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9269-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-015-9269-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9269-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T11:15:38Z","timestamp":1566818138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-015-9269-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,9]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9269"],"URL":"https:\/\/doi.org\/10.1007\/s10208-015-9269-5","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,9]]}}}