{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:15:28Z","timestamp":1757618128065,"version":"3.44.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11371253"],"award-info":[{"award-number":["11371253"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004761","name":"Natural Science Foundation of Hainan Province","doi-asserted-by":"publisher","award":["120MS029"],"award-info":[{"award-number":["120MS029"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s40314-025-03263-2","type":"journal-article","created":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T23:08:50Z","timestamp":1749164930000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Newton method for low-rank matrix completion"],"prefix":"10.1007","volume":"44","author":[{"given":"Peng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detong","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,6]]},"reference":[{"key":"3263_CR1","doi-asserted-by":"publisher","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 (2008) Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton, NJ"},{"key":"3263_CR2","doi-asserted-by":"crossref","unstructured":"Balzano L, Nowak R, Recht B (2010) Online identification and tracking of subspaces from highly incomplete information, in Proceedings of the 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton, IL, IEEE, Piscataway, NJ, pp. 704-711","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"3263_CR3","unstructured":"Bennett J, Lanning S (2007) The Netflix Prize, in Proceedings of the KDD Cup and Workshop, San Jose, CA, p. 35"},{"key":"3263_CR4","unstructured":"Boumal N, Absil P-A (2011) RTRMC: A Riemannian trust-region method for low-rank matrix completion, in Advances in Neural Information Processing Systems 24, Neural Information Processing Systems Foundation, pp. 406-414"},{"key":"3263_CR5","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.laa.2015.02.027","volume":"475","author":"N Boumal","year":"2015","unstructured":"Boumal N, Absil P-A (2015) Low-rank matrix completion via preconditioned optimization on the Grassmann manifold. Linear Algebra Appl. 475:200\u2013239","journal-title":"Linear Algebra Appl."},{"issue":"5","key":"3263_CR6","doi-asserted-by":"publisher","first-page":"S440","DOI":"10.1137\/15M1025153","volume":"38","author":"L Cambier","year":"2016","unstructured":"Cambier L, Absil P-A (2016) Roubst low-rank matrix completion by riemannian optimization. SIAM J. SCI. COMPUT. 38(5):S440\u2013S460","journal-title":"SIAM J. SCI. COMPUT."},{"issue":"3","key":"3263_CR7","doi-asserted-by":"publisher","first-page":"A1172","DOI":"10.1137\/22M1491009","volume":"45","author":"H Cai","year":"2023","unstructured":"Cai H, Cai J, You J (2023) Structured gradient descent for fast robust low-rank hankel matrix completion. SIAM J. Scien. Compu. 45(3):A1172\u2013A1198","journal-title":"SIAM J. Scien. Compu."},{"key":"3263_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s EJ, Li X, Ma Y, Wright J (2011) Robust principal component analysis? J. ACM 58:11","journal-title":"J. ACM"},{"key":"3263_CR9","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s EJ, Recht B (2009) Exact matrix completion via convex optimization. Found. Comeput. Math. 9:717\u2013772","journal-title":"Found. Comeput. Math."},{"key":"3263_CR10","unstructured":"Chen Y, Xu H, Caramanis C, Sanghavi S (2011) Robust matrix completion with corrupted columns, in Proceedings of the 28th International Conference on Machine Learning, ACM, New York, pp. 873-880"},{"key":"3263_CR11","doi-asserted-by":"crossref","unstructured":"Chistov AL, Grigor\u2019ev DYu (1984) Complexity of quantifier elimination in the theory of algebraically closed fields, in Mathematical Foundations of Computer Science, Springer. Berlin 1984:17\u201331","DOI":"10.1007\/BFb0030287"},{"key":"3263_CR12","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1109\/SAHCN.2006.288510","volume":"2","author":"P Drineas","year":"2006","unstructured":"Drineas P, Javed A, Magdon-Ismail M, Pandurangan G, Virrankoski R, Savevides A (2006) Distance matrix reconstruction from incomplete distance information for sensor network localization. in Proceedings of the 2006 3rd Annual IEEE Communications Soeciety on Sensor and Ad Hoc Communications and Networks (SECON06) 2:536\u2013544","journal-title":"in Proceedings of the 2006 3rd Annual IEEE Communications Soeciety on Sensor and Ad Hoc Communications and Networks (SECON06)"},{"key":"3263_CR13","unstructured":"Hastie T, Mazumder R, Tibshirani R (2012) Matrix Completion and Large-scale SVD Comeputations, http:\/\/web.stanford.edu\/~hastie\/TALKS\/SVDhastie.pdf"},{"key":"3263_CR14","doi-asserted-by":"crossref","unstructured":"He J, Balzano L, Szlam A (2012) Incremental gradient on the Grassmannian for online foreground and background separation in subsampled video, in Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1568- 1575","DOI":"10.1109\/CVPR.2012.6247848"},{"key":"3263_CR15","doi-asserted-by":"crossref","unstructured":"Kennedy R, Balzano L, Wright SJ, Taylor CJ (2014) Online algorithms for factorization-based structure from motion, in Proceedings of the 2014 IEEE Winter Coneference on Applications of Computer Vision (WACV), pp. 37-44","DOI":"10.1109\/WACV.2014.6836120"},{"key":"3263_CR16","doi-asserted-by":"crossref","unstructured":"Keshavan RH, Montanari A, Oh S (2009) Low-rank matrix completion with noisy observations: A quantitative comparison, in Proceedings of the 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton, IL, IEEE, Piscataway, NJ, pp. 1216-1222","DOI":"10.1109\/ALLERTON.2009.5394534"},{"key":"3263_CR17","unstructured":"Klopp O, Lounici K, Tsybakov AB (2014) Robust Matrix Completion, preprint, arXiv: 1412.8132v1 [math.ST]"},{"key":"3263_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00365-012-9176-9","volume":"37","author":"X Li","year":"2013","unstructured":"Li X (2013) Compressed sensing and matrix completion with constant proportion of corruptions. Constr. Approx. 37:73\u201399","journal-title":"Constr. Approx."},{"key":"3263_CR19","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1109\/LSP.2020.2988596","volume":"27","author":"XP Li","year":"2020","unstructured":"Li XP, Liu Q, So HC (2020) Rank-one matrix approximation with $$l_{p}$$-norm for image inpainting. IEEE SIGNAL PROCESSING LETTERS 27:680\u2013684","journal-title":"IEEE SIGNAL PROCESSING LETTERS"},{"issue":"11","key":"3263_CR20","doi-asserted-by":"publisher","first-page":"7199","DOI":"10.1109\/TCYB.2022.3224070","volume":"53","author":"XP Li","year":"2023","unstructured":"Li XP, Shi Z, Liu Qi, So HC (2023) Fast robust matrix completion via entry-wise $$l_{0}$$. IEEE Transactions on Cybernetics-Norm Minimization 53(11):7199\u20137212","journal-title":"IEEE Transactions on Cybernetics-Norm Minimization"},{"issue":"4","key":"3263_CR21","doi-asserted-by":"publisher","first-page":"2000","DOI":"10.1137\/22M1489228","volume":"15","author":"Z Li","year":"2022","unstructured":"Li Z, Sun T, Wang H, Wang B (2022) Adaptive and implicit regularization for matrix completion. SIAM J. Imag. Scien. 15(4):2000\u20132022","journal-title":"SIAM J. Imag. Scien."},{"issue":"5","key":"3263_CR22","first-page":"6759","volume":"59","author":"Z Liu","year":"2023","unstructured":"Liu Z, Li XP, So HC (2023) $$\\ell _{0}$$-norm minimization-based robust matrix completion approach for MIMO radar target localization. IEEE Transactions on Aerospace and Electronic Systems 59(5):6759\u20136770","journal-title":"IEEE Transactions on Aerospace and Electronic Systems"},{"issue":"11","key":"3263_CR23","doi-asserted-by":"publisher","first-page":"12042","DOI":"10.1109\/TCYB.2021.3072896","volume":"52","author":"F Nie","year":"2022","unstructured":"Nie F, Li Z, Hu Z, Wang R, Li X (2022) Robust Matrix Completion With Column Outliers. IEEE Transactions on Cybernetics 52(11):12042\u201312055","journal-title":"IEEE Transactions on Cybernetics"},{"key":"3263_CR24","doi-asserted-by":"crossref","unstructured":"Nie F, Huang H, Ding C (2012) Low-rank matrix recovery via efficient Schatten p-norm minimization, in Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, AAAI, Palo Alto, CA, pp. 655-661","DOI":"10.1609\/aaai.v26i1.8210"},{"key":"3263_CR25","doi-asserted-by":"crossref","unstructured":"Oh S, Montanari A, Karbasi A (2010) Sensor network localization from local connectiveity: Performance analysis for the mds-map algorithm, in Proceedings of the 2010 IEEE Information Theory Workshop on Information Theory (ITW), pp. 1-5","DOI":"10.1109\/ITWKSPS.2010.5503144"},{"issue":"1","key":"3263_CR26","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1137\/20M1323448","volume":"3","author":"G Ongie","year":"2021","unstructured":"Ongie G, Alarc\u00f3n DP, Balzano L, Willett R, Nowak RD (2021) Tensor methods for nonlinear matrix completion. SIAM J. Mathe. Data Scien. 3(1):253\u2013279","journal-title":"SIAM J. Mathe. Data Scien."},{"key":"3263_CR27","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.1109\/TPAMI.2011.282","volume":"34","author":"Y Peng","year":"2012","unstructured":"Peng Y, Ganesh A, Wright J, Xu W, Ma Y (2012) Rasl: Robust alignment by sparse and low-rank decomposition for linearly correlated images. IEEE Trans. Pattern Anal. Mach. Intell. 34:2233\u20132246","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"3263_CR28","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1109\/LSP.2023.3301244","volume":"30","author":"ZL Shi","year":"2023","unstructured":"Shi ZL, Li XP, Li W, Yan T, Wang J, Fu Y (2023) Robust low-rank matrix recovery as mixed integerProgramming via $$l_{0}$$-norm optimization. IEEE SIGNAL PROCESSING LETTERS 30:1012\u20131016","journal-title":"IEEE SIGNAL PROCESSING LETTERS"},{"key":"3263_CR29","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10107-006-0040-1","volume":"109","author":"AMC So","year":"2007","unstructured":"So AMC, Ye Y (2007) Theory of semidefinite programming for sensor network localization. Math. Program. 109:367\u2013384","journal-title":"Math. Program."},{"key":"3263_CR30","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1137\/110845768","volume":"23","author":"B Vandereycken","year":"2013","unstructured":"Vandereycken B (2013) Low-rank matrix completion by Riemannian optimization. SIAM J. Optim. 23:1214\u20131236","journal-title":"SIAM J. Optim."},{"issue":"4","key":"3263_CR31","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1109\/TCSVT.2022.3214583","volume":"33","author":"Z Wang","year":"2023","unstructured":"Wang Z, Li XP, So HC (2023) Robust matrix completion based on factorization and Truncated-Quadratic loss function. IEEE Transactions on Circuits and Systems for Video Technology 33(4):1521\u20131534","journal-title":"IEEE Transactions on Circuits and Systems for Video Technology"},{"key":"3263_CR32","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10915-013-9682-3","volume":"56","author":"M Yan","year":"2013","unstructured":"Yan M, Yang Y, Osher S (2013) Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit. J. Sci. Comput. 56:433\u2013449","journal-title":"J. Sci. Comput."},{"key":"3263_CR33","volume-title":"A Nonconvex Relaxation Approach to Robust Matrix Completion, Internal Report 14\u201361","author":"Y Yang","year":"2014","unstructured":"Yang Y, Feng Y, Suykens JAK (2014) A Nonconvex Relaxation Approach to Robust Matrix Completion, Internal Report 14\u201361. ESAT-SISTA, KU Leuven, Leuven, Belgium"},{"issue":"6","key":"3263_CR34","doi-asserted-by":"publisher","first-page":"3555","DOI":"10.1137\/09075531X","volume":"20","author":"H Zhang","year":"2010","unstructured":"Zhang H, Conn AR, Scheinberg K (2010) A derivative-free algorithm for least-squares minimization. SIAM J. Optim. 20(6):3555\u20133576","journal-title":"SIAM J. Optim."}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03263-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03263-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03263-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T18:04:44Z","timestamp":1757181884000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03263-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,6]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["3263"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03263-2","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2025,6,6]]},"assertion":[{"value":"20 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"312"}}