{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T04:08:06Z","timestamp":1769573286546,"version":"3.49.0"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"19","license":[{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","award":["Microsoft Research Asia Collaborative Research"],"award-info":[{"award-number":["Microsoft Research Asia Collaborative Research"]}],"id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61210005"],"award-info":[{"award-number":["61210005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61231010"],"award-info":[{"award-number":["61231010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61527804"],"award-info":[{"award-number":["61527804"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Science and Technology of the Peoples Republic of China","award":["973-2015CB351800"],"award-info":[{"award-number":["973-2015CB351800"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2016,10,1]]},"DOI":"10.1109\/tsp.2016.2551697","type":"journal-article","created":{"date-parts":[[2016,4,7]],"date-time":"2016-04-07T15:34:08Z","timestamp":1460043248000},"page":"4960-4974","source":"Crossref","is-referenced-by-count":15,"title":["Exploring Algorithmic Limits of Matrix Rank Minimization Under Affine Constraints"],"prefix":"10.1109","volume":"64","author":[{"given":"Bo","family":"Xin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yizhou","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Wipf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/SAM.2010.5606741"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553452"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143876"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2197748"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2156801"},{"key":"ref13","first-page":"914","article-title":"Non-convex rank minimization via an empirical Bayesian approach","author":"wipf","year":"0","journal-title":"Proc 28th Conf Uncertainty Artif Intell (UAI)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-012-9135-7"},{"key":"ref15","first-page":"211","article-title":"Sparse Bayesian learning and the relevance vector machine","volume":"1","author":"tipping","year":"2001","journal-title":"J Mach Learn Res (JMLR)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162174"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0437847100"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-013-9162-z"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/151005099"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102441"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-012-0515-x"},{"key":"ref27","first-page":"627","article-title":"Modeling user rating profiles for collaborative filtering","author":"marlin","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.88"},{"key":"ref6","first-page":"3441","article-title":"Iterative reweighted algorithms for matrix rank minimization","volume":"13","author":"mohan","year":"2012","journal-title":"J Mach Learn Res (JMLR)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281252"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.526"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9868.00196"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2393347.2396329"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref9","first-page":"419","article-title":"Pushing the limits of affine rank minimization by adapting probabilistic PCA","author":"xin","year":"0","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref20","author":"zangwill","year":"1969","journal-title":"Nonlinear Programming A Unified Approach"},{"key":"ref22","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","author":"jain","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/120876459"},{"key":"ref24","article-title":"A gradient descent algorithm on the Grassman manifold for matrix completion","author":"keshavan","year":"2009"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9084-6"},{"key":"ref26","article-title":"Collaborative filtering: A machine learning perspective","author":"marlin","year":"2004"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.21236\/ADA540730","article-title":"Efficient matrix completion with Gaussian models","author":"l\u00e9ger","year":"2010"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/7530936\/07448979.pdf?arnumber=7448979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:43:40Z","timestamp":1641987820000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7448979\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,1]]},"references-count":32,"journal-issue":{"issue":"19"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2016.2551697","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,1]]}}}