{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:00Z","timestamp":1773377940533,"version":"3.50.1"},"reference-count":46,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174368","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"1438-1443","source":"Crossref","is-referenced-by-count":2,"title":["On the Sample Complexity and Optimization Landscape for Quadratic Feasibility Problems"],"prefix":"10.1109","author":[{"given":"Parth K.","family":"Thaker","sequence":"first","affiliation":[{"name":"Arizona State University,Electrical, Computer and Energy Engineering,Tempe,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam","family":"Dasarathy","sequence":"additional","affiliation":[{"name":"Arizona State University,Electrical, Computer and Energy Engineering,Tempe,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelia","family":"Nedi\u0107","sequence":"additional","affiliation":[{"name":"Arizona State University,Electrical, Computer and Energy Engineering,Tempe,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1724","article-title":"How to escape saddle points efficiently","volume":"70","author":"jin","year":"2017","journal-title":"Proceedings of the 34th International Conference on Machine Learning"},{"key":"ref38","article-title":"Gradient descent with random initialization: Fast global convergence for nonconvex phase retrieval","author":"chen","year":"2018"},{"key":"ref33","article-title":"Solving (most) of a set of quadratic equalities: Composite optimization for robust phase retrieval","author":"duchi","year":"2017"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174368"},{"key":"ref31","article-title":"Solving complex quadratic sys-´ tems with full-rank random matrices","author":"huang","year":"2019"},{"key":"ref30","article-title":"Generalized phase retrieval: measurement number, matrix recovery and beyond","author":"wang","year":"2017","journal-title":"Applied and Computational Harmonic Analysis"},{"key":"ref37","article-title":"Gradient descent finds global minima of deep neural networks","author":"du","year":"2018"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-1236(03)00198-8"},{"key":"ref35","article-title":"Introduction to the non-asymptotic analysis of random matrices","author":"vershynin","year":"2010"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/S105262340139001X"},{"key":"ref10","article-title":"General heuristics for nonconvex quadratically constrained quadratic programming","author":"park","year":"2017"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8461868"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1941-07494-X"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-017-0521-1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-009-9539-y"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/050644471"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0203021"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450444614X"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2013.10.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.07.003"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574037"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-017-9365-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2013.08.003"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1561\/2200000058"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21432"},{"key":"ref6","author":"drenth","year":"2007","journal-title":"Principles of Protein X-ray Crystallography"},{"key":"ref29","first-page":"1233","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","volume":"70","author":"ge","year":"2017","journal-title":"Proceedings of the 34th International Conference on Machine Learning"},{"key":"ref5","article-title":"Phase retrieval using lipschitz continuous maps","author":"balan","year":"2014"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.10.029"},{"key":"ref7","author":"dakic","year":"2000","journal-title":"On the Turnpike Problem"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref9","article-title":"Reconstructing point sets from distance´ distributions","author":"huang","year":"2018"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2016.7905947"},{"key":"ref46","article-title":"Phase retrieval by projections","author":"cahill","year":"2013"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690386"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9261-0"},{"key":"ref22","article-title":"Non-convex quadratically constrained quadratic programming: Hidden convexity, scalable approximation and applications","author":"konar","year":"2017"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2736516"},{"key":"ref42","article-title":"Gradient descent converges to minimizers","author":"lee","year":"2016"},{"key":"ref24","article-title":"Phase retrieval via randomized kaczmarz: theoretical guarantees","author":"tan","year":"2017","journal-title":"Information and Inference A Journal of the IMA"},{"key":"ref41","article-title":"The nonsmooth landscape of phase retrieval","author":"davis","year":"2017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2593681"},{"key":"ref44","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"},{"key":"ref26","first-page":"4520","article-title":"Provable efficient online matrix completion via non-convex stochastic gradient descent","author":"jin","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref43","article-title":"First-order methods almost always avoid saddle points","author":"lee","year":"2017"},{"key":"ref25","first-page":"530","article-title":"Dropping convexity for faster semi-definite optimization","author":"bhojanapalli","year":"2016","journal-title":"Conference on Learning Theory"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174368.pdf?arnumber=9174368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:37Z","timestamp":1773347737000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174368\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174368","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}