{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:47Z","timestamp":1740169127328,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100011332","name":"University of Chinese Academy of Sciences","doi-asserted-by":"publisher","award":["UCAS[2015]37"],"award-info":[{"award-number":["UCAS[2015]37"]}],"id":[{"id":"10.13039\/501100011332","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2933577","type":"journal-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:02:25Z","timestamp":1565107345000},"page":"113663-113674","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Method for Non-Convex Blind Deconvolution"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0194-7648","authenticated-orcid":false,"given":"Yixian","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/120889897"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9030-4"},{"key":"ref33","first-page":"361","article-title":"On the low-rank approach for semidefinite programs arising in synchronization and community detection","author":"bandeira","year":"2016","journal-title":"Proc 29th Annu Conf Learn Theory"},{"key":"ref32","first-page":"2351","article-title":"Complete dictionary recovery using nonconvex optimization","author":"sun","year":"2015","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref31","first-page":"113","article-title":"Simple efficient and neural algorithms for sparse coding","author":"arora","year":"2015","journal-title":"Proc 28th Conf Learn Theory"},{"key":"ref30","first-page":"268","article-title":"Tensor vs. matrix methods: Robust tensor decomposition under block sparse perturbations","author":"anandkumar","year":"2016","journal-title":"Proc Artif Intell Statist"},{"key":"ref37","first-page":"355","article-title":"Angenäherte Auflösung von Systemen linearer Gleichungen","volume":"35","author":"kaczmarz","year":"1937","journal-title":"Bull Internat Acad Pol Sci Lett"},{"key":"ref36","article-title":"Phase retrieval via incremental truncated wirtinger flow","author":"kolte","year":"2016","journal-title":"arXiv 1606 03196"},{"key":"ref35","first-page":"2622","article-title":"Reshaped wirtinger flow for solving quadratic system of equations","author":"zhang","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/16M105808X"},{"key":"ref10","article-title":"Structured local optima in sparse blind deconvolution","author":"zhang","year":"2018","journal-title":"arXiv 1806 00338"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/31\/12\/125008"},{"key":"ref11","article-title":"Geometry and symmetry in short-and-sparse deconvolution","author":"kuo","year":"2019","journal-title":"arXiv 1901 00256"},{"key":"ref12","first-page":"739","article-title":"Solving random quadratic systems of equations is nearly as easy as solving linear systems","author":"chen","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756858"},{"key":"ref14","first-page":"1022","article-title":"Provable non-convex phase retrieval with outliers: Median truncated wirtinger flow","author":"zhang","year":"2016","journal-title":"Proc Int Conf Mach Learning (ICML)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.75"},{"key":"ref19","first-page":"2332","article-title":"Global convergence of stochastic gradient descent for some non-convex matrix problems","author":"sa","year":"2015","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/15M1050525"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/16M1067469"},{"key":"ref27","article-title":"Provable non-convex projected gradient descent for a class of constrained matrix optimization problems","author":"park","year":"2016","journal-title":"arXiv 1606 01316"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689779"},{"key":"ref6","article-title":"Rapid robust and reliable blind deconvolution via nonconvex optimization","author":"li","year":"2018","journal-title":"Appl Comput Harmon Anal"},{"key":"ref29","first-page":"1107","article-title":"Non-convex robust pca","author":"netrapalli","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2636204"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.466"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2569578"},{"key":"ref9","first-page":"1132","article-title":"Global geometry of multichannel sparse blind deconvolution on the sphere","author":"li","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2294644"},{"key":"ref20","article-title":"Convergence analysis for rectangular matrix completion using burer-monteiro factorization and gradient descent","author":"zheng","year":"2016","journal-title":"arXiv 1605 07051"},{"key":"ref22","first-page":"2973","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref21","first-page":"4520","article-title":"Provable efficient online matrix completion via non-convex stochastic gradient descent","author":"jin","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref24","article-title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","author":"chen","year":"2015","journal-title":"arXiv 1509 03025"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447133"},{"key":"ref23","first-page":"3873","article-title":"Global optimality of local search for low rank matrix recovery","author":"bhojanapalli","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref26","first-page":"109","article-title":"A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements","author":"zheng","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref25","first-page":"964","article-title":"Low-rank solutions of linear matrix equations via procrustes flow","author":"tu","year":"2016","journal-title":"Proc 33th Int Conf Mach Learn (ICML)"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08789383.pdf?arnumber=8789383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:31:54Z","timestamp":1641987114000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8789383\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2933577","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}