{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T16:09:20Z","timestamp":1784650160362,"version":"3.55.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,5,29]],"date-time":"2014-05-29T00:00:00Z","timestamp":1401321600000},"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":["Numer Algor"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s11075-014-9876-2","type":"journal-article","created":{"date-parts":[[2014,5,28]],"date-time":"2014-05-28T02:57:37Z","timestamp":1401245857000},"page":"903-921","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A non-convex algorithm framework based on DC programming and DCA for matrix completion"],"prefix":"10.1007","volume":"68","author":[{"given":"Juan","family":"Geng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laisheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanfei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,5,29]]},"reference":[{"key":"9876_CR1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"LTH An","year":"1997","unstructured":"An, L.T.H., Tao, P.D.: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J Global Optim. 11, 253\u2013285 (1997)","journal-title":"J Global Optim."},{"key":"9876_CR2","unstructured":"An, L.T.H., Tao, P.D.: DC programming: theory, algorithms and applications: the state of the art. In: First International Workshop on Global Constrained Optimization and Constraint Satisfaction (Cocos\u2019 02), 28 p., pp. 2\u20134. Valbonne-Sophia Antipolis, France (2002)"},{"key":"9876_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"LTH An","year":"2005","unstructured":"An, L.T.H., Tao, P.D.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9876_CR4","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/1149283.1149286","volume":"2","author":"P Biswas","year":"2006","unstructured":"Biswas, P., Liang, T.C., Ye, Y.Y.: Semidefinite programming based algorithms for sensor network localization. ACM Trans. Sensor Netw. 2(2), 188\u2013220 (2006)","journal-title":"ACM Trans. Sensor Netw."},{"issue":"4","key":"9876_CR5","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J.F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim"},{"key":"9876_CR6","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted \u2113 1 minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"6","key":"9876_CR7","doi-asserted-by":"crossref","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.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"issue":"8","key":"9876_CR8","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1109\/TPAMI.2004.52","volume":"26","author":"P Chen","year":"2004","unstructured":"Chen, P., Suter, D.: Recovering the missing components in a large noisy low rank matrix: application to SMF. IEEE Trans. Pattern Anal. Mach. Intell. 26(8), 1051\u20131063 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9876_CR9","doi-asserted-by":"crossref","unstructured":"Chistov, A.L., Grigoriev, D.Y.: Complexity of quantifier elimination in the theory of algebraically closed fields. Mathematical Foundations of Computer Science, vol. 176, pp 17\u201331. Springer Verlag (1984)","DOI":"10.1007\/BFb0030287"},{"issue":"12","key":"9876_CR10","doi-asserted-by":"crossref","first-page":"3736","DOI":"10.1109\/TIP.2006.881969","volume":"15","author":"M Elad","year":"2006","unstructured":"Elad, M., Aharon, M.: Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans. Image Process. 15(12), 3736\u20133745 (2006)","journal-title":"IEEE Trans. Image Process."},{"key":"9876_CR11","unstructured":"Fazel, M.: Matrix rank minimization with applications. PhD thesis. Stanford University (2002)"},{"key":"9876_CR12","first-page":"2156","volume":"3","author":"M Fazel","year":"2003","unstructured":"Fazel, M., Hindi, H., Boyd, S.P.: Log-det heuristic for matrix rank minimization with applications to hankel and euclidean distance matrices. Am. Control. Conf. 3, 2156\u20132162 (2003)","journal-title":"Am. Control. Conf."},{"issue":"3","key":"9876_CR13","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.acha.2008.09.001","volume":"26","author":"S Foucart","year":"2009","unstructured":"Foucart, S., Lai, M.J.: Sparsest solutions of undertermined linear systems via \u2113 p -minimization for 0<q\u22641. Appl. Comput. Harmon. Anal. 26(3), 395\u2013407 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"12","key":"9876_CR14","doi-asserted-by":"crossref","first-page":"4686","DOI":"10.1109\/TSP.2009.2026004","volume":"57","author":"G Gasso","year":"2009","unstructured":"Gasso, G., Rakotomamonjy, A., Canu, S.: Recovering sparse signals with a certain family of nonconvex penalties and DC programming. IEEE Trans. Sig. Process. 57(12), 4686\u20134698 (2009)","journal-title":"IEEE Trans. Sig. Process."},{"key":"9876_CR15","unstructured":"Ga\u00efffas, S., Lecu\u00e9, G.: :Weighted algorithms for compressed sensing and matrix completion. arXiv:preprint, arXiv:1107.1638. (2011)"},{"key":"9876_CR16","doi-asserted-by":"crossref","unstructured":"Geng, J., Wang, L.S., Fu, A.M.: A majorization-minimization weighted soft thresholding algorithm for weighted nuclear norm minimization. Inernational J Meachine Learn. Cybern. (2014)","DOI":"10.1007\/s13042-014-0241-5"},{"issue":"2","key":"9876_CR17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1011419012209","volume":"4","author":"K Goldberg","year":"2001","unstructured":"Goldberg, K., Roeder, T., Gupta, D., Perkins, C.: Eigentaste: A constant time collaborative filtering algorithm. Inf. Retr. 4(2), 133\u2013151 (2001)","journal-title":"Inf. Retr."},{"key":"9876_CR18","doi-asserted-by":"crossref","unstructured":"Goldfarb, D., Ma, S.Q., Wen, Z.W.: Solving low-rank matrix completion problems efficiently. In: 47th Annual Allerton Conference on Communication, Control, and Computing, pp. 1013\u20131020. Illinois (2009)","DOI":"10.1109\/ALLERTON.2009.5394884"},{"key":"9876_CR19","unstructured":"Hiriart Urruty, J.B., Lemarechal, C.: Convex analysis and minimization algorithms: fundamentals. Springer Verlag (1996)"},{"issue":"1","key":"9876_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R Horst","year":"1999","unstructured":"Horst, R., Thoai, N.V.: DC programming: overview. J Optim. Theory andAppl. 103(1), 1\u201343 (1999)","journal-title":"J Optim. Theory andAppl."},{"key":"9876_CR21","doi-asserted-by":"crossref","unstructured":"Ji, H., Liu, C.Q., Shen, Z.W., Xu, Y.H.: Robust video denoising using low rank matrix completion. In: 2010 IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), pp. 1791\u20131798 (2010)","DOI":"10.1109\/CVPR.2010.5539849"},{"issue":"6","key":"9876_CR22","doi-asserted-by":"crossref","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"RH Keshavan","year":"2010","unstructured":"Keshavan, R.H., Montanari, A., Oh, S.: Matrix completion from a few entries. IEEE Trans. Inf. Theory 56(6), 2980\u20132998 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9876_CR23","doi-asserted-by":"crossref","unstructured":"Kong, L.C., Xiu, N.H.: Exact low-rank matrix recovery via nonconvex schatten p-minimization. Asia-Pac. J. Oper. Reasearch 30(3) (2013)","DOI":"10.1142\/S0217595913400101"},{"issue":"2","key":"9876_CR24","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"MJ Lai","year":"2013","unstructured":"Lai, M.J., Xu, Y.Y., Yin, W.T.: Improved iteratively reweighted least squares for unconstrained smoothed \u2113 q minimization. SIAM J. Numer. Anal. 51(2), 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"9876_CR25","first-page":"82","volume":"21","author":"MJ Lai","year":"2010","unstructured":"Lai, M.J., Wang, J.Y.: An unconstrainted \u2113 q minimization with 0<q\u22641 for sparse solution of underdetermined linear systems. SIAM J. Optim. 21(1), 82\u2013101 (2010)","journal-title":"SIAM J. Optim."},{"issue":"9","key":"9876_CR26","doi-asserted-by":"crossref","first-page":"4402","DOI":"10.1109\/TIT.2010.2054251","volume":"56","author":"K Lee","year":"2010","unstructured":"Lee, K., Bresler, Y.: Admira: atomic decomposition for minimum rank approximation. IEEE Trans. Inf. Theory 56(9), 4402\u20134416 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9876_CR27","first-page":"173","volume":"2","author":"AS Lewis","year":"1995","unstructured":"Lewis, A.S.: The convex analysis of unitarily invariant matrix norms. J. Convex Analysis 2, 173\u2013183 (1995)","journal-title":"J. Convex Analysis"},{"key":"9876_CR28","unstructured":"Lin, Z.C., Chen, M.M., Ma, Y.: The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv:preprint, arXiv:1009.5055. (2010)"},{"issue":"1\u20132","key":"9876_CR29","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10107-010-0437-8","volume":"133","author":"YJ Liu","year":"2012","unstructured":"Liu, Y.J., Sun, D.F., Toh, K.C.: An implementable proximal point algorithmic framework for nuclear norm minimization. Math. Program. 133(1\u20132), 399\u2013436 (2012)","journal-title":"Math. Program."},{"key":"9876_CR30","unstructured":"Meka, R., Jain, P., Dhillon, I.S.: Guaranteed rank minimization via singular value projection. Adv. Neural Inf. Process. Syst., 937\u2013945 (2010)"},{"key":"9876_CR31","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"9876_CR32","doi-asserted-by":"crossref","unstructured":"Tanner, J., Wei, K.: Normalized iterative hard thresholding for matrix completion. Proceedings available online at http:\/\/people.maths.ox.ac.uk\/tanner\/papers\/TaWei_NIHT.pdf . (2013)","DOI":"10.1137\/120876459"},{"key":"9876_CR33","unstructured":"Tao, P.D., An, L.T.H.: Convex analysis approach to d.c. programming: Theory, Algorithms and Applications. Acta Mathematica Vietnamica, (dedicated to Professor Hoang Tuy on the occasion of his 70th birthday), vol. 22, pp. 289\u2013355 (1997)"},{"issue":"2","key":"9876_CR34","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"PD Tao","year":"1998","unstructured":"Tao, P.D., An, L.T.H.: A d.c. optimization algorithms for solving the trust region subproblem. SIAM J. Optim. 8(2), 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"9876_CR35","first-page":"615","volume":"6","author":"KC Toh","year":"2010","unstructured":"Toh, K.C., Yun, S.W.: An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pac. J. Optim. 6, 615\u2013640 (2010)","journal-title":"Pac. J. Optim."},{"issue":"2","key":"9876_CR36","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH Ttnc","year":"2003","unstructured":"Ttnc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95(2), 189\u2013217 (2003)","journal-title":"Math. Program."},{"key":"9876_CR37","unstructured":"Xu, J.: Reweighted Nuclear Norm Minimization for Matrix Completion. Proceedings available online at https:\/\/webspace.utexas.edu\/jx598\/www\/Reweighted.pdf . (2011)"},{"issue":"5","key":"9876_CR38","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/TCSVT.2009.2017400","volume":"19","author":"M Wang","year":"2009","unstructured":"Wang, M., Hua, X.S., Hong, R.C., Tang, J.H., Qi, G., Song, Y.: Unified video annotation via multigraph learning. IEEE Trans. Circ. Syst. Video Technol. 19(5), 733\u2013746 (2009)","journal-title":"IEEE Trans. Circ. Syst. Video Technol."},{"issue":"3","key":"9876_CR39","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1109\/TMM.2009.2012919","volume":"11","author":"M Wang","year":"2009","unstructured":"Wang, M., Hua, X.S., Tang, J.H., Hong, R.C.: Beyond distance measurement: Constructing neighborhood similarity for video annotation. IEEE Trans. Multimed. 11(3), 465\u2013476 (2009)","journal-title":"IEEE Trans. Multimed."},{"issue":"5","key":"9876_CR40","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1109\/TSMCB.2009.2013196","volume":"39","author":"X Wang","year":"2009","unstructured":"Wang, X., Wang, S., Bi, D.W.: Distributed visual-target-surveillance system in wireless sensor networks. IEEE Trans. Syst. Man Cybern. Part B, Cybern. 39(5), 1134\u20131146 (2009)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B, Cybern."},{"issue":"4","key":"9876_CR41","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"ZW Wen","year":"2012","unstructured":"Wen, Z.W., Yin, W.T., Zhang, Y.: Solving a low-rank factorization model for matrix completion by nonlinear successive over-relaxation algorithm. Math. Program. Comput. 4(4), 333\u2013361 (2012)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"9876_CR42","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1109\/TCSVT.2008.918455","volume":"18","author":"B Zeng","year":"2008","unstructured":"Zeng, B., Fu, J.J.: Directional discrete cosine transforms-a new framework for image coding. IEEE Trans. Circ. Syst. Circ. Syst. Video Technol. 18(3), 305\u2013313 (2008)","journal-title":"IEEE Trans. Circ. Syst. Circ. Syst. Video Technol."},{"key":"9876_CR43","doi-asserted-by":"crossref","unstructured":"Zhu, G., Yan, S., Ma, Y.: Image tag refinement towards low-rank, content-tag prior and error sparsity. Proceedings of the international conference on Multimedia. ACM, 461\u2013470 (2010)","DOI":"10.1145\/1873951.1874028"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9876-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-014-9876-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9876-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T02:22:17Z","timestamp":1565490137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-014-9876-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,29]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9876"],"URL":"https:\/\/doi.org\/10.1007\/s11075-014-9876-2","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,29]]}}}