{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T04:26:09Z","timestamp":1730262369598,"version":"3.28.0"},"reference-count":41,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100009105","name":"Ministry of Internal Affairs and Communications","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009105","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,11,1]]},"DOI":"10.1109\/ieeeconf51394.2020.9443404","type":"proceedings-article","created":{"date-parts":[[2021,6,4]],"date-time":"2021-06-04T01:32:35Z","timestamp":1622770355000},"page":"1327-1332","source":"Crossref","is-referenced-by-count":0,"title":["Discrete-Aware Matrix Completion via Proximal Gradient"],"prefix":"10.1109","author":[{"given":"Hiroki","family":"Iimori","sequence":"first","affiliation":[]},{"given":"Giuseppe Thadeu Freitas","family":"de Abreu","sequence":"additional","affiliation":[]},{"given":"Omid","family":"Taghizadeh","sequence":"additional","affiliation":[]},{"given":"Koji","family":"Ishibashi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2878886"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICOIN48656.2020.9016519"},{"key":"ref33","first-page":"1","article-title":"Optimal discrete matrix completion","author":"huo","year":"2016","journal-title":"Proc AAAI"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098008"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301208"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2947012"},{"article-title":"Proximal gradient algorithms: Applications in signal processing","year":"2018","author":"antonello","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2823268"},{"key":"ref34","first-page":"1","article-title":"Robust discrete matrix completion","author":"huang","year":"2013","journal-title":"Proc AAAI"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref40","first-page":"345","article-title":"First order algorithms in variational image processing","author":"burger","year":"2017","journal-title":"Splitting Methods in Communication Imaging Science and Engineering"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805762"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3216-0_8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805766"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref16","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pacific J Opt"},{"key":"ref17","first-page":"3367","article-title":"Matrix completion and low-rank SVD via fast alternating least squares","volume":"16","author":"hastie","year":"2015","journal-title":"J Machine Learning Res"},{"key":"ref18","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"mazumder","year":"2010","journal-title":"J Machine Learning Res"},{"key":"ref19","first-page":"4002","article-title":"Accelerated inexact soft-impute for fast large-scale matrix completion","author":"yao","year":"2015","journal-title":"Proc IJCAI"},{"journal-title":"CoRR","article-title":"Discreteness-aware receivers for overloaded MIMO systems","year":"2020","author":"iimori","key":"ref28"},{"journal-title":"Ph D Dissertation","article-title":"Matrix rank minimization with applications","year":"2002","author":"fazel","key":"ref4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2414932"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2928130"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/462"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF44664.2019.9048777"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2858249"},{"key":"ref7","first-page":"379","article-title":"Accelerated proximal gradient methods for nonconvex programming","author":"li","year":"2015","journal-title":"Proc NIPS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2937282"},{"key":"ref9","first-page":"1","article-title":"Non-convex matrix completion and related problems via strong duality","volume":"20","author":"balcan","year":"2019","journal-title":"J Machine Learning Res"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0306-5"},{"journal-title":"Proc ACM Symp Theory Comp","article-title":"Low-rank matrix completion using alternating minimization","year":"2012","author":"jain","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/100781894"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970888"},{"journal-title":"CoRR","article-title":"OptSpace : A gradient descent algorithm on the grassman manifold for matrix completion","year":"2009","author":"keshavan","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2739140"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF44664.2019.9048779"}],"event":{"name":"2020 54th Asilomar Conference on Signals, Systems, and Computers","start":{"date-parts":[[2020,11,1]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2020,11,4]]}},"container-title":["2020 54th Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9443248\/9443268\/09443404.pdf?arnumber=9443404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T21:50:12Z","timestamp":1656453012000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9443404\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,1]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/ieeeconf51394.2020.9443404","relation":{},"subject":[],"published":{"date-parts":[[2020,11,1]]}}}