{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T16:44:41Z","timestamp":1779295481512,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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":[[2013,6]]},"DOI":"10.1145\/2488608.2488693","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"665-674","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":471,"title":["Low-rank matrix completion using alternating minimization"],"prefix":"10.1145","author":[{"given":"Prateek","family":"Jain","sequence":"first","affiliation":[{"name":"Microsoft Research India, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Praneeth","family":"Netrapalli","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sujay","family":"Sanghavi","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drq039"},{"key":"e_1_3_2_1_8_1","volume-title":"Matrix Computations","author":"Golub G. H.","year":"1996","unstructured":"G. H. Golub and C. F. V. Loan . Matrix Computations . The Johns Hopkins University Press , 1996 . G. H. Golub and C. F. V. Loan. Matrix Computations. The Johns Hopkins University Press, 1996."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339612"},{"key":"e_1_3_2_1_10_1","first-page":"945","volume-title":"NIPS","author":"Jain P.","year":"2010","unstructured":"P. Jain , R. Meka , and I. S. Dhillon . Guaranteed rank minimization via singular value projection . In NIPS , pages 937?- 945 , 2010 . P. Jain, R. Meka, and I. S. Dhillon. Guaranteed rank minimization via singular value projection. In NIPS, pages 937?-945, 2010."},{"key":"e_1_3_2_1_11_1","volume-title":"Low-rank matrix completion using alternating minimization. arXiv preprint arXiv:1212.0467","author":"Jain P.","year":"2012","unstructured":"P. Jain , P. Netrapalli , and S. Sanghavi . Low-rank matrix completion using alternating minimization. arXiv preprint arXiv:1212.0467 , 2012 . P. Jain, P. Netrapalli, and S. Sanghavi. Low-rank matrix completion using alternating minimization. arXiv preprint arXiv:1212.0467, 2012."},{"key":"e_1_3_2_1_12_1","first-page":"1001","volume-title":"ICML","author":"Jalali A.","unstructured":"A. Jalali , Y. Chen , S. Sanghavi , and H. Xu . Clustering partially observed graphs via convex optimization . In ICML , pages 1001 -?1008, 2011. A. Jalali, Y. Chen, S. Sanghavi, and H. Xu. Clustering partially observed graphs via convex optimization. In ICML, pages 1001-?1008, 2011."},{"key":"e_1_3_2_1_13_1","volume-title":"Efficient algorithms for collaborative filtering. Phd Thesis","author":"Keshavan R. H.","year":"2012","unstructured":"R. H. Keshavan . Efficient algorithms for collaborative filtering. Phd Thesis , Stanford University , 2012 . R. H. Keshavan. Efficient algorithms for collaborative filtering. Phd Thesis, Stanford University, 2012."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/07069239X"},{"key":"e_1_3_2_1_17_1","volume-title":"The BellKor solution to the Netflix grand prize","author":"Koren Y.","year":"2009","unstructured":"Y. Koren . The BellKor solution to the Netflix grand prize , 2009 . Y. Koren. The BellKor solution to the Netflix grand prize, 2009."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054251"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390239"},{"key":"e_1_3_2_1_21_1","volume-title":"417-?431","author":"Peeters R.","year":"1996","unstructured":"R. Peeters . Orthogonal representations over finite fields and the chromatic number of graphs. Combinatorica , 16 : 417-?431 , 1996 . R. Peeters. Orthogonal representations over finite fields and the chromatic number of graphs. Combinatorica, 16:417-?431, 1996."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"e_1_3_2_1_23_1","volume-title":"Nonlinear Programming: A Unified Approach","author":"Zangwill W. I.","year":"1969","unstructured":"W. I. Zangwill . Nonlinear Programming: A Unified Approach . Englewood Cliffs : Prentice-Hall , 1969 . W. I. Zangwill. Nonlinear Programming: A Unified Approach. Englewood Cliffs: Prentice-Hall, 1969."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68880-8_32"},{"key":"e_1_3_2_1_25_1","volume-title":"Sparse principal component analysis. JCGS, 15(2):262-?286","author":"Zou H.","year":"2006","unstructured":"H. Zou , T. Hastie , and R. Tibshirani . Sparse principal component analysis. JCGS, 15(2):262-?286 , 2006 . H. Zou, T. Hastie, and R. Tibshirani. Sparse principal component analysis. JCGS, 15(2):262-?286, 2006."}],"event":{"name":"STOC'13: Symposium on Theory of Computing","location":"Palo Alto California USA","acronym":"STOC'13","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488693","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":24,"alternative-id":["10.1145\/2488608.2488693","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488693","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}