{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T04:29:23Z","timestamp":1730262563021,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"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":[[2019,11]]},"DOI":"10.1109\/ieeeconf44664.2019.9048840","type":"proceedings-article","created":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T05:10:33Z","timestamp":1585631433000},"page":"259-263","source":"Crossref","is-referenced-by-count":2,"title":["Manifold Proximal Point Algorithms for Dual Principal Component Pursuit and Orthogonal Dictionary Learning"],"prefix":"10.1109","author":[{"given":"Shixiang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Zengde","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Shiqian","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Anthony Man-Cho","family":"So","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"Dual principal component pursuit: probability analysis and efficient algorithms","year":"2018","author":"zhu","key":"ref10"},{"article-title":"Efficient dictionary learning with gradient descent","year":"2018","author":"gilboa","key":"ref11"},{"key":"ref12","article-title":"Subgradient descent learns orthogonal dictionaries","author":"bai","year":"2019","journal-title":"ICLRE"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/16M1069298"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.97"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0314056"},{"key":"ref16","first-page":"11","article-title":"Augmented lagrangian methods and proximal point methods for convex optimization","volume":"8","author":"iusem","year":"1999","journal-title":"Investigacin Operativa"},{"key":"ref17","first-page":"73","article-title":"The proximal algorithm","author":"lemaire","year":"1989","journal-title":"International Series of Numerical Mathematics"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/02331930290019413"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau007"},{"key":"ref27","article-title":"Dual principal component pursuit: Improved analysis and efficient algorithms","author":"zhu","year":"2018","journal-title":"NIPS"},{"key":"ref3","article-title":"Exact recovery of sparsely-used dictionaries","author":"spielman","year":"2012","journal-title":"COLT"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2632162"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2601599"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2853141"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2632149"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682499"},{"key":"ref9","article-title":"Dual principal component pursuit","author":"tsakiris","year":"2018","journal-title":"Journal of Machine Learning Research"},{"journal-title":"Optimization Algorithms on Matrix Manifolds","year":"2009","author":"absil","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/15M101988X"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-015-0861-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2013.07.002"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-017-1093-4"},{"article-title":"Convergence of inexact descent methods for nonconvex optimization on Riemannian manifolds","year":"2011","author":"bento","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/16M1097572"},{"key":"ref25","article-title":"Proximal gradient method for nonsmooth optimization over the Stiefel manifold","author":"chen","year":"2019","journal-title":"Accepted in SIAM J Optimization"}],"event":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","start":{"date-parts":[[2019,11,3]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2019,11,6]]}},"container-title":["2019 53rd Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9034466\/9048648\/09048840.pdf?arnumber=9048840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:54:20Z","timestamp":1658094860000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9048840\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/ieeeconf44664.2019.9048840","relation":{},"subject":[],"published":{"date-parts":[[2019,11]]}}}