{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T19:35:20Z","timestamp":1730230520892,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"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,5]]},"DOI":"10.1109\/icassp.2019.8682357","type":"proceedings-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T20:01:56Z","timestamp":1555531316000},"page":"5526-5530","source":"Crossref","is-referenced-by-count":1,"title":["Solving Quadratic Equations via Amplitude-based Nonconvex Optimization"],"prefix":"10.1109","author":[{"given":"Vincent","family":"Monardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanxin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuejie","family":"Chi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Solving random quadratic systems of equations is nearly as easy as solving linear systems","author":"chen","year":"2015","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref11","article-title":"Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval, matrix completion and blind deconvolution","author":"ma","year":"2017","journal-title":"arXiv preprint arXiv 1711 11585"},{"key":"ref12","article-title":"Nonconvex optimization meets low-rank matrix factorization: An overview","author":"chi","year":"2018","journal-title":"arXiv preprint arXiv 1809 09573"},{"key":"ref13","first-page":"1","article-title":"The local convexity of solving systems of quadratic equations","author":"sanghavi","year":"2016","journal-title":"Results in Mathematics"},{"key":"ref14","article-title":"Nonconvex matrix factorization from rank-one measurements","author":"li","year":"2018","journal-title":"arXiv preprint arxiv 1802 05807"},{"key":"ref15","first-page":"5164","article-title":"A nonconvex approach for phase retrieval: Reshaped Wirtinger flow and incremental algorithms","volume":"18","author":"zhang","year":"2017","journal-title":"The Journal of Machine Learning Research"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756858"},{"key":"ref17","article-title":"Approximate message passing for amplitude based optimization","author":"ma","year":"2018","journal-title":"arXiv preprint arXiv 1806 03276"},{"key":"ref18","article-title":"Solving systems of quadratic equations via exponential-type gradient descent algorithm","author":"huang","year":"2018","journal-title":"arXiv preprint arXiv 1806 00904"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24486-0_1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1364\/AO.21.002758"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1267"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2352673"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21432"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2620109"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0738-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2429594"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1124097"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref20","article-title":"Improved algorithms for matrix recovery from rank-one projections","author":"soltani","year":"2017","journal-title":"arXiv preprint arXiv 1705 07469"},{"key":"ref22","first-page":"237","article-title":"A practical algorithm for the determination of phase from image and diffraction plane pictures","volume":"35","author":"gerchberg","year":"1972","journal-title":"Optik"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023673105317"},{"key":"ref24","article-title":"Gradient descent with random initialization: Fast global convergence for nonconvex phase retrieval","author":"chen","year":"2018","journal-title":"arXiv preprint arXiv 1803 07726"},{"key":"ref23","first-page":"1022","article-title":"Provable non-convex phase retrieval with outliers: Median truncated Wirtinger flow","author":"zhang","year":"2016","journal-title":"International Conference on Machine Learning"}],"event":{"name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2019,5,12]]},"location":"Brighton, United Kingdom","end":{"date-parts":[[2019,5,17]]}},"container-title":["ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8671773\/8682151\/08682357.pdf?arnumber=8682357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:12:51Z","timestamp":1657854771000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8682357\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icassp.2019.8682357","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}