{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T05:03:07Z","timestamp":1744261387769,"version":"3.37.3"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["681839"],"award-info":[{"award-number":["681839"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["R-263-000-D02-281"],"award-info":[{"award-number":["R-263-000-D02-281"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Singapore Ministry of Education Tier 2","award":["R-263-000-C83-112"],"award-info":[{"award-number":["R-263-000-C83-112"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tsp.2021.3071293","type":"journal-article","created":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T19:36:25Z","timestamp":1617737785000},"page":"3059-3074","source":"Crossref","is-referenced-by-count":3,"title":["Positive Semidefinite Matrix Factorization: A Connection With Phase Retrieval and Affine Rank Minimization"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6179-0219","authenticated-orcid":false,"given":"Dana","family":"Lahat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanbin","family":"Lang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5008-4527","authenticated-orcid":false,"given":"Vincent Y. F.","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3801-5534","authenticated-orcid":false,"given":"Cedric","family":"Fevotte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1007\/s10208-018-09410-y"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1007\/s10107-002-0352-8"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1093\/imaiai\/iav011"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/JSTSP.2010.2042411"},{"key":"ref31","first-page":"543","article-title":"A method of solving a convex programming problem with convergence rate $o\\bigl (\\frac{1}{k^2}\\bigr)$","volume":"269","author":"nesterov","year":"1983","journal-title":"Dokl Akad Nauk SSSR"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1016\/j.acha.2009.04.002"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1007\/s10107-014-0848-z"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1002\/cpa.21638"},{"key":"ref35","first-page":"1035","article-title":"Positive semidefinite matrix factorization based on truncated Wirtinger flow","author":"lahat","year":"0","journal-title":"Proc 28th Eur Signal Process Conf"},{"key":"ref34","first-page":"5705","article-title":"Positive semidefinite matrix factorization: A link to phase retrieval and a block gradient algorithm","author":"lahat","year":"0","journal-title":"Proc Int Conf Acoust Speech Signal Process"},{"key":"ref28","first-page":"1617","article-title":"PhasePack: A phase retrieval library","author":"chandra","year":"0","journal-title":"Proc 13th Int Conf Sampling Theory Appl"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1002\/cpa.21638"},{"key":"ref29","first-page":"2:1","article-title":"Computing approximate PSD factorizations","volume":"60","author":"basu","year":"0","journal-title":"Proc APPROX\/RANDOM"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/2213977.2213988"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1287\/moor.1120.0575"},{"key":"ref20","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","author":"jain","year":"0","journal-title":"Proc NeurIPS"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1137\/120876459"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1007\/s10208-011-9084-6"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1137\/151005099"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1002\/cpa.21432"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/TSP.2016.2585084"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TIT.2015.2399924"},{"year":"2011","author":"kaibel","article-title":"Extended formulations in combinatorial optimization","key":"ref10"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.22331\/q-2020-02-14-230"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1007\/s00454-018-9988-x"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TIT.2013.2258372"},{"key":"ref13","first-page":"1496","article-title":"Expressive power of tensor-network factorizations for probabilistic modeling","volume":"32","author":"glasser","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"year":"2016","author":"stark","article-title":"Recommender systems inspired by the structure of quantum theory","key":"ref14"},{"year":"2002","author":"fazel","article-title":"Matrix rank minimization with applications","key":"ref15"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1145\/1390156.1390239"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1137\/070697835"},{"key":"ref18","first-page":"109","article-title":"A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements","author":"zheng","year":"0","journal-title":"Proc NeurIPS"},{"key":"ref19","first-page":"964","article-title":"Low-rank solutions of linear matrix equations via Procrustes flow","volume":"48","author":"tu","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1007\/s10107-015-0922-1"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1007\/s10589-018-9998-x"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1016\/0024-3795(93)90224-C"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1137\/1016064"},{"key":"ref8","first-page":"1141","article-title":"When does non-negative matrix factorization give a correct decomposition into parts?","author":"donoho","year":"0","journal-title":"Proc NeurIPS"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1002\/env.3170050203"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.1016\/j.laa.2009.02.034"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1016\/0022-0000(91)90024-Y"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1137\/110845768"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1109\/TSP.2019.2944740"},{"year":"0","author":"vandaele","journal-title":"Code for PSD Factorization","key":"ref48"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1137\/15M1050525"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1038\/44565"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1016\/1352-2310(94)00367-T"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1109\/ACSSC.2008.5074571"},{"year":"2013","author":"lee","article-title":"Support-based lower bounds for the positive semidefinite rank of a nonnegative matrix","key":"ref43"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9307529\/09397331.pdf?arnumber=9397331","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:34Z","timestamp":1652194234000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9397331\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/tsp.2021.3071293","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2021]]}}}