{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T19:23:33Z","timestamp":1790623413100,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,12]],"date-time":"2012-08-12T00:00:00Z","timestamp":1344729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,8,12]]},"DOI":"10.1145\/2339530.2339581","type":"proceedings-article","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T12:18:56Z","timestamp":1344946736000},"page":"298-306","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Accelerated singular value thresholding for matrix completion"],"prefix":"10.1145","author":[{"given":"Yao","family":"Hu","sequence":"first","affiliation":[{"name":"Zhejiang University, HangZhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Debing","family":"Zhang","sequence":"additional","affiliation":[{"name":"Zhejiang University, HangZhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Liu","sequence":"additional","affiliation":[{"name":"Siemens Corporate Research, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jieping","family":"Ye","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaofei","family":"He","sequence":"additional","affiliation":[{"name":"Zhejiang University, HangZhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,8,12]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020504"},{"key":"e_1_3_2_2_2_1","unstructured":"J. Burkardt. Cities - city distance datasets. http:\/\/www.csit.fsu.edu\/~burkardt\/datasets\/ cities\/cities.html.  J. Burkardt. Cities - city distance datasets. http:\/\/www.csit.fsu.edu\/~burkardt\/datasets\/ cities\/cities.html."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864721"},{"key":"e_1_3_2_2_7_1","volume-title":"IEEE Conference on Computer Vision and Pattern Recognition","author":"Eriksson A.","year":"2010","unstructured":"A. Eriksson and A. van den Hengel. Efficient computation of robust low-rank matrix approximations in the presence of missing data using the l1 norm . In IEEE Conference on Computer Vision and Pattern Recognition , San Francisco, CA, USA , 2010 . A. Eriksson and A. van den Hengel. Efficient computation of robust low-rank matrix approximations in the presence of missing data using the l1 norm. In IEEE Conference on Computer Vision and Pattern Recognition, San Francisco, CA, USA, 2010."},{"key":"e_1_3_2_2_9_1","volume-title":"http:\/\/www.grouplens.org\/taxonomy\/term\/14","author":"Group","year":"2009","unstructured":"Group Lens. Movielens. http:\/\/www.grouplens.org\/taxonomy\/term\/14 , 2009 . GroupLens. Movielens. http:\/\/www.grouplens.org\/taxonomy\/term\/14, 2009."},{"key":"e_1_3_2_2_10_1","volume-title":"Convex Analysis and Minimization Algorithms","author":"Hiriart-Urruty J.-B.","year":"1996","unstructured":"J.-B. Hiriart-Urruty and C. Lemar\u00e9chal . Convex Analysis and Minimization Algorithms . Springer Verlag , Heidelberg , 1996 . Two volumes - 2nd printing. J.-B. Hiriart-Urruty and C. Lemar\u00e9chal. Convex Analysis and Minimization Algorithms. Springer Verlag, Heidelberg, 1996. Two volumes - 2nd printing."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539849"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557072"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2010.5651225"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557082"},{"key":"e_1_3_2_2_17_1","first-page":"2114","volume-title":"International Conference on Computer Vision","author":"Liu J.","year":"2009","unstructured":"J. Liu , P. Musialski , P. Wonka , and J. Ye . Tensor completion for estimating missing values in visual data . In International Conference on Computer Vision , pages 2114 -- 2121 , Kyoto, Japan , 2009 . J. Liu, P. Musialski, P. Wonka, and J. Ye. Tensor completion for estimating missing values in visual data. In International Conference on Computer Vision, pages 2114--2121, Kyoto, Japan, 2009."},{"key":"e_1_3_2_2_18_1","volume-title":"Lecture Notes","author":"Nemirovski A.","year":"1994","unstructured":"A. Nemirovski . Efficient Methods in Convex Programming . Lecture Notes , 1994 . A. Nemirovski. Efficient Methods in Convex Programming. Lecture Notes, 1994."},{"key":"e_1_3_2_2_19_1","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Nesterov Y.","year":"2003","unstructured":"Y. Nesterov . Introductory Lectures on Convex Optimization: A Basic Course . Kluwer Academic Publishers , 2003 . Y. Nesterov. Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, 2003."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"e_1_3_2_2_21_1","volume-title":"Inverse Problems","author":"Silvia Gandy B. R.","year":"2011","unstructured":"B. R. Silvia Gandy and I. Yamada . Tensor completion and low-n-rank tensor recovery via convex optimization . Inverse Problems , 2011 . B. R. Silvia Gandy and I. Yamada. Tensor completion and low-n-rank tensor recovery via convex optimization. Inverse Problems, 2011."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835895"},{"key":"e_1_3_2_2_23_1","volume-title":"a matlab toolbox for optimization over symmetric cones","author":"Sturm J. F.","year":"1998","unstructured":"J. F. Sturm . Using sedumi 1.02 , a matlab toolbox for optimization over symmetric cones , 1998 . J. F. Sturm. Using sedumi 1.02, a matlab toolbox for optimization over symmetric cones, 1998."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-006-0050-6"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1096"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2008.2002825"},{"key":"e_1_3_2_2_27_1","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems","volume":"6","author":"Toh K.-C.","year":"2010","unstructured":"K.-C. Toh and S. Yun . An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems . Pacific Journal of Optimization , 6 : 615 -- 640 , 2010 . K.-C. Toh and S. Yun. An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pacific Journal of Optimization, 6:615--640, 2010.","journal-title":"Pacific Journal of Optimization"},{"key":"e_1_3_2_2_28_1","volume-title":"Sdpt3 - a matlab software package for semidefinite quadratic linear programming, version 3.0","author":"Tutuncu R. H.","year":"2001","unstructured":"R. H. Tutuncu , K. C. Toh , and M. J. Todd . Sdpt3 - a matlab software package for semidefinite quadratic linear programming, version 3.0 , 2001 . R. H. Tutuncu, K. C. Toh, and M. J. Todd. Sdpt3 - a matlab software package for semidefinite quadratic linear programming, version 3.0, 2001."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277752"}],"event":{"name":"KDD '12: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Beijing China","acronym":"KDD '12","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339581","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2339530.2339581","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:08Z","timestamp":1750238468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,12]]},"references-count":28,"alternative-id":["10.1145\/2339530.2339581","10.1145\/2339530"],"URL":"https:\/\/doi.org\/10.1145\/2339530.2339581","relation":{},"subject":[],"published":{"date-parts":[[2012,8,12]]},"assertion":[{"value":"2012-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}