{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:04:01Z","timestamp":1725591841637},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"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,12]]},"DOI":"10.1109\/camsap45676.2019.9022447","type":"proceedings-article","created":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T09:14:43Z","timestamp":1583486083000},"page":"16-20","source":"Crossref","is-referenced-by-count":1,"title":["The Geometric Effects of Distributing Constrained Nonconvex Optimization Problems"],"prefix":"10.1109","author":[{"given":"Qiuwei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinshuo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihui","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gongguo","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael B.","family":"Wakin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"3873","article-title":"Global optimality of local search for low rank matrix recovery","author":"bhojanapalli","year":"2016","journal-title":"Advances in neural information processing systems"},{"journal-title":"Symmetry saddle points and global geometry of nonconvex matrix factorization","year":"2016","author":"li","key":"ref11"},{"journal-title":"First-order methods almost always avoid saddle points","year":"2017","author":"lee","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2014.2310456"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2637314"},{"journal-title":"Global optimality in distributed low-rank matrix factorization","year":"2018","author":"zhu","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682568"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2632149"},{"key":"ref18","first-page":"1132","article-title":"Global geometry of multichannel sparse blind deconvolution on the sphere","author":"li","year":"2018","journal-title":"Advances in Neural IInformation Processing Systems"},{"journal-title":"Numerical Optimization","year":"2006","author":"nocedal","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2835403"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1561\/9781680833690","author":"jain","year":"2017","journal-title":"Non-Convex Optimization for Machine Learning ser Foundations and Trends in Machine Learning Series"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iay003"},{"journal-title":"The global optimization geometry of low-rank matrix optimization","year":"2017","author":"zhu","key":"ref5"},{"key":"ref8","first-page":"1233","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","author":"ge","year":"0","journal-title":"International Conference on Machine Learning"},{"journal-title":"Robust low-rank matrix recovery","year":"2018","author":"li","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2821706"},{"journal-title":"Nonconvex optimization meets low-rank matrix factorization An overview","year":"2018","author":"chi","key":"ref1"},{"key":"ref9","first-page":"2973","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"2016","journal-title":"Advances in neural information processing systems"},{"journal-title":"Optimization Algorithms on Matrix Manifolds","year":"2009","author":"absil","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2632162"},{"journal-title":"When are nonconvex problems not scary?","year":"2015","author":"sun","key":"ref21"}],"event":{"name":"2019 IEEE 8th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)","start":{"date-parts":[[2019,12,15]]},"location":"Le gosier, Guadeloupe","end":{"date-parts":[[2019,12,18]]}},"container-title":["2019 IEEE 8th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8993415\/9022434\/09022447.pdf?arnumber=9022447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T23:08:50Z","timestamp":1657840130000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9022447\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/camsap45676.2019.9022447","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}