{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T02:46:05Z","timestamp":1777603565620,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T00:00:00Z","timestamp":1584921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T00:00:00Z","timestamp":1584921600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003407","name":"MIUR","doi-asserted-by":"crossref","award":["PRIN 2017 project \u201dDiscontinuous dynamical systems: theory"],"award-info":[{"award-number":["PRIN 2017 project \u201dDiscontinuous dynamical systems: theory"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003407","name":"MIUR","doi-asserted-by":"crossref","award":["numerics and applications\u201d"],"award-info":[{"award-number":["numerics and applications\u201d"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10444-020-09779-x","type":"journal-article","created":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T16:04:01Z","timestamp":1584979441000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An efficient method for non-negative low-rank completion"],"prefix":"10.1007","volume":"46","author":[{"given":"Nicola","family":"Guglielmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmela","family":"Scalone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,23]]},"reference":[{"key":"9779_CR1","doi-asserted-by":"crossref","unstructured":"Ang, A.M.S., Gillis N.: Accelerating nonnegative matrix factorization algorithms using extrapolation. arXiv:1805.06604 (2018)","DOI":"10.1162\/neco_a_01157"},{"key":"9779_CR2","doi-asserted-by":"crossref","unstructured":"Ang, A.M.S., Gillis N.: Algorithms and comparisons of non-negative matrix factorization with volume regularization for hyperspectral unmixing. arXiv:1903.04362 (2019)","DOI":"10.1109\/JSTARS.2019.2925098"},{"key":"9779_CR3","unstructured":"Bennet, J., Lanning, S.: The netflix prize. In: Proceedings of the KKD cup and workshop. San Jose, CA, USA, 12 August 2007, pp. 35 (2007)"},{"key":"9779_CR4","doi-asserted-by":"crossref","unstructured":"Berman, A., Plemmons, R.J.: Nonnegative matrices in the mathematical sciences. Classics in Applied Mathematics Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1994)","DOI":"10.1137\/1.9781611971262"},{"key":"9779_CR5","doi-asserted-by":"crossref","unstructured":"Brand, M.: Incremental singular value decomposition of uncertain data with missing values. In: European conference on computer vision. Lecture Notes in Computer Science, vol. 2350, pp 707\u2013720. Springer, Berlin (2002)","DOI":"10.1007\/3-540-47969-4_47"},{"key":"9779_CR6","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J.F., Cand\u00e9s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"9779_CR7","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1137\/15M1025153","volume":"38","author":"L Cambier","year":"2016","unstructured":"Cambier, L., Absil, P.A.: Robust low-rank matrix completion by riemannian optimization. SIAM J. Sci. Comput. 38, 440\u2013460 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"9779_CR8","doi-asserted-by":"crossref","unstructured":"Chen, D., Plemmons, R.J.: Nonnegativity constraints in numerical analysis. The Birth of Numerical Analysis, pp. 109\u2013139 (2009)","DOI":"10.1142\/9789812836267_0008"},{"key":"9779_CR9","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e9s adn","year":"2009","unstructured":"Cand\u00e9s adn, E.J., Recht, B.: Exact matrix completion via convex optimization. Foundations of Comput. Math. 9, 717\u2013772 (2009)","journal-title":"Foundations of Comput. Math."},{"key":"9779_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s11081-008-9072-0","volume":"11","author":"Y Ding","year":"2010","unstructured":"Ding, Y., Krislock, N., Qian, J., Wolkowicz, H.: Sensor network localization, euclidean distance matrix completions, and graph realization. Optim. Eng. 11, 45\u201366 (2010)","journal-title":"Optim. Eng."},{"key":"9779_CR11","unstructured":"Fletcher, R.: Practical methods of optimization. Wiley, New York (2013)"},{"key":"9779_CR12","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/110820361","volume":"4","author":"N Gillis","year":"2011","unstructured":"Gillis, N., Glineur, F.: Low-rank matrix approximation with weights or missing data is NP-hard. SIAM J. Matrix Anal. Appl. 4, 1149\u20131165 (2011)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9779_CR13","doi-asserted-by":"publisher","first-page":"2685","DOI":"10.1016\/j.laa.2012.06.038","volume":"437","author":"N Gillis","year":"2012","unstructured":"Gillis, N., Glineur, F.: On the geometric interpretation of non-negative rank. Linear Algebra and its Applications 437, 2685\u20132712 (2012)","journal-title":"Linear Algebra and its Applications"},{"key":"9779_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/138859.138867","volume":"35","author":"D Goldberg","year":"1992","unstructured":"Goldberg, D., Nichols, D., Oki, B.M., Terry, D.: Using collaborative filtering to weave an information tapestry. Commun. ACM 35, 61\u201370 (1992)","journal-title":"Commun. ACM"},{"key":"9779_CR15","doi-asserted-by":"publisher","first-page":"3991\u20144007","DOI":"10.1016\/j.laa.2012.04.033","volume":"438","author":"N Gillis","year":"2013","unstructured":"Gillis, N., Plemmons, R.J.: Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis. Linear Algebra and its Applications 438, 3991\u20144007 (2013)","journal-title":"Linear Algebra and its Applications"},{"key":"9779_CR16","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1137\/120862399","volume":"34","author":"N Guglielmi","year":"2013","unstructured":"Guglielmi, N., Lubich, C.: Low-rank dynamics for computing extremal points of real pseudospectra. SIAM J. Matrix Anal. Appl. 34, 40\u201366 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9779_CR17","first-page":"1194","volume":"49","author":"N Guglielmi","year":"2011","unstructured":"Guglielmi, N., Lubich, C.: Differential equations for roaming pseudospectra: paths to extremal points and boundary tracking. SIAM J. Matrix Anal. Appl. 49, 1194\u20131209 (2011)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9779_CR18","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1137\/16M1079026","volume":"38","author":"N Guglielmi","year":"2017","unstructured":"Guglielmi, N., Lubich, C., Mehrmann, V.: On the nearest singular matrix pencil. SIAM J. Matrix Anal. Appl. 38, 776\u2013806 (2017)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9779_CR19","unstructured":"Jawanpuria, P., Mishra, B.: Structured low-rank matrix learning: algorithms and applications. arXiv:1704.07352 (2018)"},{"key":"9779_CR20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.cviu.2016.04.011","volume":"150","author":"R Kennedy","year":"2016","unstructured":"Kennedy, R., Balzano, L., Wright, S.J., Taylor, C.J.: Online algorithms for factorization-based structure from motion. Comput. Vis. Image Underst. 150, 139\u2013152 (2016)","journal-title":"Comput. Vis. Image Underst."},{"key":"9779_CR21","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1137\/050639703","volume":"29","author":"O Koch","year":"2007","unstructured":"Koch, O., Lubich, C.: Dynamical low-rank approximation. SIAM J. Matrix Anal. Appl. 29, 434\u2013454 (2007)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9779_CR22","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1137\/120883050","volume":"34","author":"I Markovsky adn","year":"2013","unstructured":"Markovsky adn, I., Usevich, K.: Structured low-rank approximation with missing data. SIAM J. Matrix Anal. Appl. 34, 814\u2013830 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9779_CR23","unstructured":"Mitra, K., Sheorey, S., Chellappa, R.: Large-scale matrix factorization with missing data under additional constraints. Advances in neural information processing systems 23: 24th Annual Conference on Neural Information Processing Systems, pp. 1651\u20131659 (2010)"},{"key":"9779_CR24","unstructured":"Padoan, R., Steemers, A.G., Klein, M.E., Aalderink, B., Bruin, G.de.: Quantitative Hyperspectral imaging of hystorical documents: Technique and applications. 9th International Conference on NDT of Art, Jerusalem Israel, 25\u201330 May 2008 (2008)"},{"key":"9779_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.3390\/axioms7030051","volume":"7","author":"C Scalone","year":"2018","unstructured":"Scalone, C., Guglielmi, N.: A gradient system for low rank matrix completion. Axioms 7, 51 (2018)","journal-title":"Axioms"},{"key":"9779_CR26","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s11464-012-0194-5","volume":"7","author":"Y Xu","year":"2012","unstructured":"Xu, Y., Yin, W., Wen, Z., Yin, W.: An alternating direction algorithm for matrix completion with nonnegative factors. Frontiers of Mathematics in China 7, 365\u2013384 (2012)","journal-title":"Frontiers of Mathematics in China"},{"key":"9779_CR27","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/110845768","volume":"23","author":"B Vandereycken","year":"2013","unstructured":"Vandereycken, B.: Low-rank matrix completion by Riemaniann optimization. SIAM J. Optim. 23, 367\u2013384 (2013)","journal-title":"SIAM J. Optim."}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-020-09779-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-020-09779-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-020-09779-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:22:27Z","timestamp":1616458947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-020-09779-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,23]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["9779"],"URL":"https:\/\/doi.org\/10.1007\/s10444-020-09779-x","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,23]]},"assertion":[{"value":"24 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"31"}}