{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T05:21:51Z","timestamp":1776921711803,"version":"3.51.2"},"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"],"award-info":[{"award-number":["11131006"]}],"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":["41390450"],"award-info":[{"award-number":["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"],"award-info":[{"award-number":["91330204"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the National Basic Research Program of China","award":["2013CB329404"],"award-info":[{"award-number":["2013CB329404"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11271297"],"award-info":[{"award-number":["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"],"award-info":[{"award-number":["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":14,"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":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jigen","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigang","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"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<q\\le 1$$\n                    \n                      \n                        \n                          0\n                          <\n                          q\n                          \u2264\n                          1\n                        \n                      \n                    \n                   for sparse solution of underdetermined linear systems. SIAM Journal on Optimization, 21(1), 82\u2013101.","journal-title":"SIAM Journal on Optimization"},{"key":"549_CR23","unstructured":"Li, G., & Pong, T. (2016). Calculus of the exponent of Kurdyka\u2013\u0141ojasiewicz inequality and its applications to linear convergence of first-order methods. \n                    arXiv:1602.02915v1\n                    \n                  ."},{"issue":"2","key":"549_CR24","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10107-014-0806-9","volume":"153","author":"G Li","year":"2015","unstructured":"Li, G., Mordukhovich, B. S., & Pham, T. S. (2015). New fractional error bounds for polynomial systems with applications to H\u00f6lderian stability in optimization and spectral theory of tensors. Mathematical Programming, 153(2), 333\u2013362.","journal-title":"Mathematical Programming"},{"issue":"3","key":"549_CR25","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/090755436","volume":"31","author":"Z Liu","year":"2009","unstructured":"Liu, Z., & Vandenberghe, L. (2009). Interior-point method for nuclear norm approximation with application to system identification. SIAM Journal on Matrix Analysis and Applications, 31(3), 1235\u20131256.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"549_CR26","unstructured":"Lu, Z. S., & Zhang, Y. (2015). Schatten-\n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                   quasi-norm regularized matrix optimization via iterative reweighted singular value minimization. \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2015\/11\/5215.html\n                    \n                  ."},{"key":"549_CR27","unstructured":"Lu, C. Y., Tang, J. H., Yan, S. C., & Lin, Z. C. (2015). Nonconvex nonsmooth low-rank minimization via iteratively reweighted nuclear norm. \n                    arXiv:1510.06895\n                    \n                  ."},{"issue":"1","key":"549_CR28","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"SQ Ma","year":"2011","unstructured":"Ma, S. Q., Goldfarb, D., & Chen, L. F. (2011). Fixed point and Bregman iterative methods for matrix rank minimization. Mathematical Programming, 128(1), 321\u2013353.","journal-title":"Mathematical Programming"},{"key":"549_CR29","unstructured":"Mohammadi, M. M., Zadeh, M. B., Amini, A., & Jutten, C. (2013). Recovery of low-rank matrices under affine constraints via a smoothed rank function. \n                    arXiv:1308.2293\n                    \n                  ."},{"issue":"1","key":"549_CR30","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/TSP.2008.2007606","volume":"57","author":"MM Mohammadi","year":"2009","unstructured":"Mohammadi, M. M., Zadeh, M. B., & Jutten, C. (2009). A fast approach for overcomplete sparse decomposition based on smoothed \n                    \n                      \n                    \n                    $$\\ell _0$$\n                    \n                      \n                        \n                          \u2113\n                          0\n                        \n                      \n                    \n                  -norm. IEEE Transactions on Signal Processing, 57(1), 289\u2013301.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"3","key":"549_CR31","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., & Parrilo, P. A. (2010). Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review, 52(3), 471\u2013501.","journal-title":"SIAM Review"},{"key":"549_CR32","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"R Rockafellar","year":"1970","unstructured":"Rockafellar, R. (1970). Convex analysis. Princeton: Princeton University Press."},{"issue":"28","key":"549_CR33","doi-asserted-by":"publisher","first-page":"9507","DOI":"10.1073\/pnas.0709842104","volume":"105","author":"A Singer","year":"2008","unstructured":"Singer, A. (2008). A remark on global positioning from local distances. Proceedings of the National Academy of Sciences of the United States of America, 105(28), 9507\u20139511.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"549_CR34","unstructured":"Srebro, N. (2004). Learning with matrix factorizations. Ph.D. thesis, Massachusetts Institute of Technology."},{"issue":"3","key":"549_CR35","first-page":"615","volume":"6","author":"KC Toh","year":"2012","unstructured":"Toh, K. C., & Yun, S. W. (2012). An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pacific Journal of Optimization, 6(3), 615\u2013640.","journal-title":"Pacific Journal of Optimization"},{"issue":"2","key":"549_CR36","doi-asserted-by":"publisher","first-page":"137C154","DOI":"10.1007\/BF00129684","volume":"9","author":"C Tomasi","year":"1992","unstructured":"Tomasi, C., & Kanade, T. (1992). Shape and motion from image streams under orthography: A factorization method. International Journal of Computer Vision, 9(2), 137C154.","journal-title":"International Journal of Computer Vision"},{"issue":"3","key":"549_CR37","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng, P. (2001). Convergence of a block coordinate descent method for nondifferentiable minimization. Journal of Optimization Theory and Applications, 109(3), 475\u2013494.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"2","key":"549_CR38","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R. H., Toh, K. C., & Todd, M. J. (2003). Solving semidefinite-quadratic-linear programs using SDPT3. Mathematical Programming, 95(2), 189\u2013217.","journal-title":"Mathematical Programming"},{"issue":"281","key":"549_CR39","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1090\/S0025-5718-2012-02598-1","volume":"82","author":"JF Yang","year":"2013","unstructured":"Yang, J. F., & Yuan, X. M. (2013). Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization. Mathematics of Computation, 82(281), 301\u2013329.","journal-title":"Mathematics of Computation"},{"key":"549_CR40","unstructured":"Zhang, S., & Xin, J. (2014). Minimization of transformed \n                    \n                      \n                    \n                    $$\\ell _1$$\n                    \n                      \n                        \n                          \u2113\n                          1\n                        \n                      \n                    \n                   penalty: Closed form representation and iterative thresholding algorithms. arXiv preprint \n                    arXiv:1412.5240\n                    \n                  ."},{"key":"549_CR41","unstructured":"Zhang, S., Yin, P. H., & Xin, J. (2015). Transformed Schatten-1 iterative thresholding algorithms for matrix rank minimization and applications. \n                    arXiv:1506.04444\n                    \n                  ."},{"issue":"2","key":"549_CR42","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C. H. (2010). Nearly unbiased variable selection under minimax concave penalty. The Annals of Statistics, 38(2), 894\u2013942.","journal-title":"The Annals of Statistics"},{"issue":"Mar","key":"549_CR43","first-page":"1081","volume":"11","author":"T Zhang","year":"2010","unstructured":"Zhang, T. (2010). Analysis of multi-stage convex relaxation for sparse regularization. Journal of Machine Learning Research, 11(Mar), 1081\u20131107.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"549_CR44","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.laa.2012.02.021","volume":"437","author":"YB Zhao","year":"2012","unstructured":"Zhao, Y. B. (2012). An approximation theory of matrix rank minimization and its application to quadratic equations. Linear Algebra and Its Applications, 437(1), 77\u201393.","journal-title":"Linear Algebra and Its Applications"}],"container-title":["Multidimensional Systems and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11045-018-0549-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11045-018-0549-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11045-018-0549-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,19]],"date-time":"2020-01-19T01:13:02Z","timestamp":1579396382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11045-018-0549-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,16]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["549"],"URL":"https:\/\/doi.org\/10.1007\/s11045-018-0549-5","relation":{},"ISSN":["0923-6082","1573-0824"],"issn-type":[{"value":"0923-6082","type":"print"},{"value":"1573-0824","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,16]]},"assertion":[{"value":"1 January 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}