{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T10:24:42Z","timestamp":1766485482932,"version":"3.37.3"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["ARO W911NF19-1-0407"],"award-info":[{"award-number":["ARO W911NF19-1-0407"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tsp.2022.3177845","type":"journal-article","created":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T19:33:21Z","timestamp":1653593601000},"page":"3221-3236","source":"Crossref","is-referenced-by-count":10,"title":["Memory-Efficient Convex Optimization for Self-Dictionary Separable Nonnegative Matrix Factorization: A Frank\u2013Wolfe Approach"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1986-9841","authenticated-orcid":false,"given":"Tri","family":"Nguyen","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4847-9586","authenticated-orcid":false,"given":"Xiao","family":"Fu","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7751-4355","authenticated-orcid":false,"given":"Ruiyuan","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, The Chinese University of Hong Kong Shatin, N.T., Hong Kong, SAR"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/MSP.2018.2877582"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1137\/1.9781611976410"},{"key":"ref3","first-page":"280","article-title":"A practical algorithm for topic modeling with provable guarantees","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Arora","year":"2013"},{"key":"ref4","first-page":"1786","article-title":"Anchor-free correlated topic modeling: Identifiability and algorithm","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Huang","year":"2016"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/TPAMI.2018.2827377"},{"key":"ref6","first-page":"2859","article-title":"Detecting overlapping and correlated communities without pure nodes: Identifiability and Algorithm","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Huang","year":"2019"},{"key":"ref7","first-page":"2324","article-title":"On mixed memberships and symmetric nonnegative matrix factorizations","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Mao","year":"2017"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1007\/978-3-319-72150-7_5"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TSP.2021.3109380"},{"key":"ref10","first-page":"4544","article-title":"Crowdsourcing via annotator co-occurrence imputation and provable symmetric nonnegative matrix factorization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ibrahim","year":"2021"},{"key":"ref11","first-page":"7847","article-title":"Crowdsourcing via pairwise co-occurrences: Identifiability and Algorithms","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ibrahim","year":"2019"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TSP.2021.3090960"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1137\/070709967"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/MSP.2020.3003544"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/LSP.2015.2498523"},{"issue":"1","key":"ref16","first-page":"1249","article-title":"Robust near-separable nonnegative matrix factorization using linear optimization","volume":"15","author":"Gillis","year":"2014","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/JSTSP.2015.2410763"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/TPAMI.2013.226"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/FOCS.2012.49"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/MSP.2013.2279731"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1016\/S0169-7439(01)00119-8"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/TAES.2003.1261124"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/TGRS.2011.2141672"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/TGRS.2005.844293"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TSP.2015.2404577"},{"key":"ref26","first-page":"1","article-title":"Greedy algorithms for pure pixels identification in hyperspectral unmixing: A multiple-measurement vector viewpoint","volume-title":"Proc. 21st Eur. Signal Process. Conf.","author":"Fu","year":"2013"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TIP.2012.2190081"},{"key":"ref28","first-page":"1214","article-title":"Factoring nonnegative matrices with linear programs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Recht","year":"2012"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/CVPR.2012.6247852"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/TIP.2017.2753400"},{"issue":"1","key":"ref31","first-page":"1011","article-title":"Ellipsoidal rounding for nonnegative matrix factorization under noisy separability","volume":"15","author":"Mizutani","year":"2014","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/TSP.2016.2560142"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/TIP.2014.2362056"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.21437\/eurospeech.1999-65"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1007\/3-540-45735-6_1"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1145\/2740908.2742839"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1109\/IEEECONF56349.2022.10051825"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1109\/TSP.2016.2602800"},{"key":"ref39","first-page":"1141","article-title":"When does non-negative matrix factorization give a correct decomposition into parts?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"16","author":"Donoho","year":"2003"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1109\/TSP.2008.928937"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1016\/j.sigpro.2005.05.031"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1109\/TSP.2006.881263"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1117\/12.366289"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1137\/120900629"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1002\/nav.3800030109"},{"key":"ref46","first-page":"427","article-title":"Revisiting Frank-Wolfe: Projection-free sparse convex optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jaggi","year":"2013"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1007\/s10107-014-0841-6"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1017\/CBO9780511804441"},{"key":"ref49","first-page":"12211","article-title":"Projection efficient subgradient method and optimal nonsmooth FrankWolfe method","volume":"33","author":"Thekumparampil","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1007\/s10107-004-0552-5"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1109\/TKDE.2010.165"},{"doi-asserted-by":"publisher","key":"ref52","DOI":"10.1109\/TKDE.2005.198"},{"key":"ref53","first-page":"231","article-title":"Fast conical hull algorithms for near-separable non-negative matrix factorization","volume-title":"Int. Conf. Mach. Learn.","author":"Kumar","year":"2013"},{"key":"ref54","first-page":"993","article-title":"Latent Dirichlet allocation","volume":"3","author":"Blei","year":"2003","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"publisher","key":"ref55","DOI":"10.1145\/2133806.2133826"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9675017\/09782542.pdf?arnumber=9782542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T02:41:22Z","timestamp":1706755282000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9782542\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/tsp.2022.3177845","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2022]]}}}