{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T10:34:29Z","timestamp":1742639669489,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,1,16]],"date-time":"2018-01-16T00:00:00Z","timestamp":1516060800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11131006","41390450"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["91330204"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the National Basic Research Program of China","award":["2013CB329404"]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11271297"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Marie Curie International Research Staff Exchange Scheme Fellowship within the 7th European Community Framework Programme LIVCODE","award":["295151"]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multidim Syst Sign Process"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s11045-018-0549-5","type":"journal-article","created":{"date-parts":[[2018,1,16]],"date-time":"2018-01-16T02:56:42Z","timestamp":1516071402000},"page":"145-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A new nonconvex approach to low-rank matrix completion with application to image inpainting"],"prefix":"10.1007","volume":"30","author":[{"given":"Yongchao","family":"Yu","sequence":"first","affiliation":[]},{"given":"Jigen","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Shigang","family":"Yue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,16]]},"reference":[{"issue":"1","key":"549_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., & Bolte, J. (2009). On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Mathematical Programming, 116(1), 5\u201316.","journal-title":"Mathematical Programming"},{"issue":"2","key":"549_CR2","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., & Soubeyran, A. (2010). Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka\u2013\u0141ojasiewicz inequality. Mathematics of Operations Research, 35(2), 438\u2013457.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"549_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF00940050","volume":"73","author":"A Auslender","year":"1992","unstructured":"Auslender, A. (1992). Asymptotic properties of the Fenchel dual functional and applications to decomposition problems. Journal of Optimization Theory and Applications, 73(3), 427\u2013449.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"549_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex analysis and monotone operator theory in Hilbert spaces. CMS Books in Mathematics","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H. H., & Combettes, P. L. (2011). Convex analysis and monotone operator theory in Hilbert spaces. CMS Books in Mathematics. New York: Springer."},{"issue":"1","key":"549_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., & Teboulle, M. (2009). A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences, 2(1), 183\u2013202.","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"549_CR6","unstructured":"Bertsekas, D. (1999). Nonlinear optimisation, 2nd ed., Athena, Belmont, Massachusetts."},{"issue":"1","key":"549_CR7","first-page":"459","volume":"146","author":"J Bolte","year":"2013","unstructured":"Bolte, J., Sabach, S., & Teboulle, M. (2013). Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Mathematical Programming, 146(1), 459\u2013494.","journal-title":"Mathematical Programming"},{"issue":"4","key":"549_CR8","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J. F., Cand\u00e8s, E. J., & Shen, Z. W. (2010). A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4), 1956\u20131982.","journal-title":"SIAM Journal on Optimization"},{"issue":"6","key":"549_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, E. J., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717\u2013772.","journal-title":"Foundations of Computational Mathematics"},{"issue":"8","key":"549_CR10","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E. J., Romberg, J., & Tao, T. (2006). Stable signal recovery from incomplete and inaccurate measurements. Communications on Pure and Applied Mathematics, 59(8), 1207\u20131223.","journal-title":"Communications on Pure and Applied Mathematics"},{"issue":"5","key":"549_CR11","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E. J., & Tao, T. (2010). The power of convex relaxation: Near-optimal matrix completion. IEEE Transactions on Information Theory, 56(5), 2053\u20132080.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"549_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/MSP.2007.914731","volume":"25","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E. J., & Wakin, M. (2008). An introduction to compressive sampling. IEEE Signal Processing Magazine, 25(2), 21\u201330.","journal-title":"IEEE Signal Processing Magazine"},{"issue":"1","key":"549_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jvcir.2012.10.006","volume":"24","author":"WF Cao","year":"2013","unstructured":"Cao, W. F., Sun, J., & Xu, Z. B. (2013). Fast image deconvolution using closed-form thresholding formulas of \n \n \n \n $$L_q$$\n \n \n \n L\n q\n \n \n \n \n \n \n \n \n $$(q = 1\/2, 2\/3)$$\n \n \n \n (\n q\n =\n 1\n \/\n 2\n ,\n 2\n \/\n 3\n )\n \n \n \n regularization. Journal of Visual Communication and Image Representation, 24(1), 31\u201341.","journal-title":"Journal of Visual Communication and Image Representation"},{"issue":"8","key":"549_CR14","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1109\/TPAMI.2004.52","volume":"26","author":"P Chen","year":"2004","unstructured":"Chen, P., & Suter, D. (2004). Recovering the missing components in a large noisy low-rank matrix: Application to SFM source. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(8), 1051\u20131063.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"456","key":"549_CR15","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"JQ Fan","year":"2001","unstructured":"Fan, J. Q., & Li, R. Z. (2001). Variable selection via nonconcave penalized likelihood and its oracle properties. Journal of the American Statistical Association, 96(456), 1348\u20131360.","journal-title":"Journal of the American Statistical Association"},{"key":"549_CR16","unstructured":"Fazel, M. (2002). Matrix rank minimization with applications. Ph.D. thesis, Stanford University."},{"key":"549_CR17","unstructured":"FPCA: \n http:\/\/www1.se.cuhk.edu.hk\/~sqma\/softwares.html\n \n ."},{"issue":"4","key":"549_CR18","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1007\/s11075-014-9876-2","volume":"68","author":"J Geng","year":"2015","unstructured":"Geng, J., Wang, L. S., & Wang, Y. F. (2015). A non-convex algorithm framework based on DC programming and DCA for matrix completion. Numerical Algorithms, 68(4), 903\u2013921.","journal-title":"Numerical Algorithms"},{"issue":"12","key":"549_CR19","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. (1992). Using collaborative filtering to weave an information tapestry. Communications of the ACM, 35(12), 61\u201370.","journal-title":"Communications of the ACM"},{"issue":"9","key":"549_CR20","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1109\/TPAMI.2012.271","volume":"35","author":"Y Hu","year":"2013","unstructured":"Hu, Y., Zhang, D. B., Ye, J. P., Li, X. L., & He, X. F. (2013). Fast and accurate matrix completion via truncated nuclear norm regularization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(9), 2117\u20132130.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"549_CR21","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s10915-015-0045-0","volume":"66","author":"ZF Jin","year":"2016","unstructured":"Jin, Z. F., Wan, Z. P., Jiao, Y. L., & Lu, J. X. (2016). An alternating direction method with continuation for nonconvex low rank minimization. Journal of Scientific Computing, 66(2), 849\u2013869.","journal-title":"Journal of Scientific Computing"},{"issue":"1","key":"549_CR22","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1137\/090775397","volume":"21","author":"MJ Lai","year":"2011","unstructured":"Lai, M. J., & Wang, J. Y. (2011). An unconstrained \n \n \n \n $$\\ell _q$$\n \n \n \n \u2113\n q\n \n \n \n minimization with \n \n \n \n $$0