{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T09:40:06Z","timestamp":1743846006947,"version":"3.40.3"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T00:00:00Z","timestamp":1729987200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T00:00:00Z","timestamp":1729987200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,10,27]]},"DOI":"10.1109\/ieeeconf60004.2024.10943107","type":"proceedings-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T18:20:20Z","timestamp":1743790820000},"page":"916-920","source":"Crossref","is-referenced-by-count":0,"title":["Discrete Aware Matrix Completion via Convexized $\\ell_{0}$-Norm Approximation"],"prefix":"10.1109","author":[{"given":"Niclas","family":"F\u00fchrling","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Constructor University,Bremen,Germany,28759"}]},{"given":"Kengo","family":"Ando","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Constructor University,Bremen,Germany,28759"}]},{"given":"Giuseppe Thadeu","family":"Freitas De Abreu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Constructor University,Bremen,Germany,28759"}]},{"given":"David Gonz\u00e1lez","family":"G.","sequence":"additional","affiliation":[{"name":"Wireless Communications Technologies Group, Continental AG,Frankfurt am Main,Germany,65936"}]},{"given":"Osvaldo","family":"Gonsa","sequence":"additional","affiliation":[{"name":"Wireless Communications Technologies Group, Continental AG,Frankfurt am Main,Germany,65936"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-021-01629-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2915226"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2870533"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2928130"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2171521"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/110845768"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF51394.2020.9443404"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0611042"},{"issue":"147","key":"ref16","first-page":"1","article-title":"Matrix completion with noisy entries and outliers","volume":"18","author":"Wong","year":"2017","journal-title":"Journal of Machine Learning Research"},{"key":"ref17","article-title":"Guaranteed rank minimization via singular value projection","volume-title":"NIPS","author":"Meka","year":"2009"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2015.08.003"},{"key":"ref20","first-page":"1798","volume-title":"A scalable, adaptive and sound nonconvex regularizer for low-rank matrix learning","author":"Wang","year":"2021"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"issue":"01","key":"ref22","doi-asserted-by":"crossref","DOI":"10.1093\/imaiai\/iay003","article-title":"The non-convex geometry of low-rank matrix optimization","volume":"8","author":"Li","year":"2018","journal-title":"Information and Inference: A Journal of the IMA"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2937282"},{"issue":"2","key":"ref24","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s12532-013-0053-8","article-title":"Parallel stochastic gradient algorithms for large-scale matrix completion","volume":"5","author":"Recht","year":"2013","journal-title":"Mathematical Programming Computation"},{"key":"ref25","first-page":"1654","article-title":"Improved bounded matrix completion for large-scale recommender systems","author":"Fang","year":"2017","journal-title":"IJCAI"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2867533"},{"key":"ref27","first-page":"543","article-title":"A method for solving the convex programming problem with convergence rate O(1\/k2)","volume":"269","author":"Nesterov","year":"1983","journal-title":"Dokl. Akad. Nauk SSSR"},{"volume-title":"Proximal gradient algorithms: Applications in signal processing","year":"2020","author":"Antonello","key":"ref28"},{"issue":"1","key":"ref29","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/TSP.2008.2007606","article-title":"A fast approach for overcomplete sparse decomposition based on smoothed \u21130 norm","volume":"57","author":"Mohimani","year":"2009","journal-title":"IEEE Transactions on Signal Processing"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2812733"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2812748"},{"issue":"80","key":"ref32","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"Mazumder","year":"2010","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"ref33","doi-asserted-by":"crossref","first-page":"38002","DOI":"10.1209\/0295-5075\/117\/38002","article-title":"Link prediction via matrix completion","volume":"117","author":"Pech","year":"2017","journal-title":"EPL (Europhysics Letters)"}],"event":{"name":"2024 58th Asilomar Conference on Signals, Systems, and Computers","start":{"date-parts":[[2024,10,27]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2024,10,30]]}},"container-title":["2024 58th Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10942562\/10942606\/10943107.pdf?arnumber=10943107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T09:11:47Z","timestamp":1743844307000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10943107\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,27]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/ieeeconf60004.2024.10943107","relation":{},"subject":[],"published":{"date-parts":[[2024,10,27]]}}}