{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T22:07:09Z","timestamp":1787782029312,"version":"build-2784847793"},"reference-count":113,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T00:00:00Z","timestamp":1502668800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10208-017-9365-9","type":"journal-article","created":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T11:50:38Z","timestamp":1502711438000},"page":"1131-1198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":196,"title":["A Geometric Analysis of Phase Retrieval"],"prefix":"10.1007","volume":"18","author":[{"given":"Ju","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qing","family":"Qu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Wright","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,8,14]]},"reference":[{"key":"9365_CR1","doi-asserted-by":"crossref","unstructured":"Pierre-Antoine Absil, Christopher G. Baker, and Kyle A. Gallivan. Trust-region methods on Riemannian manifolds. Foundations of Computational Mathematics, 7(3):303\u2013330, 2007.","DOI":"10.1007\/s10208-005-0179-9"},{"key":"9365_CR2","unstructured":"Pierre-Antoine. Absil, Robert Mahoney, and Rodolphe Sepulchre. Optimization Algorithms on Matrix Manifolds. Princeton University Press, 2009."},{"key":"9365_CR3","unstructured":"Alekh Agarwal, Animashree Anandkumar, Prateek Jain, Praneeth Netrapalli, and Rashish Tandon. Learning sparsely used overcomplete dictionaries via alternating minimization. arXiv preprint arXiv:1310.7991 , 2013."},{"key":"9365_CR4","unstructured":"Alekh Agarwal, Animashree Anandkumar, and Praneeth Netrapalli. Exact recovery of sparsely used overcomplete dictionaries. arXiv preprint arXiv:1309.1952 , 2013."},{"issue":"1","key":"9365_CR5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1137\/12089939X","volume":"7","author":"Boris Alexeev","year":"2014","unstructured":"Boris Alexeev, Afonso\u00a0S. Bandeira, Matthew Fickus, and Dustin\u00a0G. Mixon. Phase retrieval with polarization. SIAM Journal on Imaging Sciences, 7(1):35\u201366, 2014.","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"9365_CR6","unstructured":"Anima Anandkumar and Rong Ge. Efficient approaches for escaping higher order saddle points in non-convex optimization. arXiv preprint arXiv:1602.05908 , 2016."},{"key":"9365_CR7","unstructured":"Animashree Anandkumar, Rong Ge, and Majid Janzamin. Analyzing tensor power method dynamics: Applications to learning overcomplete latent variable models. arXiv preprint arXiv:1411.1488 , 2014."},{"key":"9365_CR8","unstructured":"Animashree Anandkumar, Rong Ge, and Majid Janzamin. Guaranteed non-orthogonal tensor decomposition via alternating rank-1 updates. arXiv preprint arXiv:1402.5180 , 2014."},{"key":"9365_CR9","unstructured":"Animashree Anandkumar, Prateek Jain, Yang Shi, and Uma\u00a0Naresh Niranjan. Tensor vs matrix methods: Robust tensor decomposition under block sparse perturbations. arXiv preprint arXiv:1510.04747 , 2015."},{"key":"9365_CR10","unstructured":"Sanjeev Arora, Aditya Bhaskara, Rong Ge, and Tengyu Ma. More algorithms for provable dictionary learning. arXiv preprint arXiv:1401.0579 , 2014."},{"key":"9365_CR11","unstructured":"Sanjeev Arora, Rong Ge, Tengyu Ma, and Ankur Moitra. Simple, efficient, and neural algorithms for sparse coding. arXiv preprint arXiv:1503.00778 , 2015."},{"key":"9365_CR12","unstructured":"Sanjeev Arora, Rong Ge, and Ankur Moitra. New algorithms for learning incoherent and overcomplete dictionaries. arXiv preprint arXiv:1308.6273 , 2013."},{"key":"9365_CR13","unstructured":"Sohail Bahmani and Justin Romberg. Phase retrieval meets statistical learning theory: A flexible convex relaxation. arXiv preprint arXiv:1610.04210 , 2016."},{"issue":"4","key":"9365_CR14","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1007\/s00041-009-9065-1","volume":"15","author":"Radu Balan","year":"2009","unstructured":"Radu Balan, Bernhard\u00a0G. Bodmann, Peter\u00a0G. Casazza, and Dan Edidin. Painless reconstruction from magnitudes of frame coefficients. Journal of Fourier Analysis and Applications, 15(4):488\u2013501, 2009.","journal-title":"Journal of Fourier Analysis and Applications"},{"key":"9365_CR15","doi-asserted-by":"crossref","unstructured":"Radu V. Balan. On signal reconstruction from its spectrogram. In Information Sciences and Systems (CISS), 44th Annual Conference on, pp. 1\u20134. IEEE, 2010.","DOI":"10.1109\/CISS.2010.5464828"},{"issue":"3","key":"9365_CR16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.acha.2005.07.001","volume":"20","author":"Radu Balana","year":"2006","unstructured":"Radu Balana, Pete Casazzab, and Dan Edidin. On signal reconstruction without phase. Applied and Computational Harmonic Analysis, 20(3):345 \u2013 356, 2006.","journal-title":"Applied and Computational Harmonic Analysis"},{"key":"9365_CR17","unstructured":"Afonso S. Bandeira, Nicolas Boumal, and Vladislav Voroninski. On the low-rank approach for semidefinite programs arising in synchronization and community detection. arXiv preprint arXiv:1602.04426 , 2016."},{"key":"9365_CR18","unstructured":"Tamir Bendory and Yonina C. Eldar. Non-convex phase retrieval from STFT measurements. arXiv preprint arXiv:1607.08218 , 2016."},{"key":"9365_CR19","unstructured":"Dimitri P. Bertsekas. Nonlinear programming. 1999."},{"key":"9365_CR20","unstructured":"Srinadh Bhojanapalli, Behnam Neyshabur, and Nathan Srebro. Global optimality of local search for low rank matrix recovery. arXiv preprint arXiv:1605.07221 , 2016."},{"key":"9365_CR21","doi-asserted-by":"crossref","unstructured":"St\u00e9phane Boucheron, G\u00e1bor Lugosi, and Pascal Massart. Concentration inequalities: A nonasymptotic theory of independence. Oxford University Press, Oxford, 2013.","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"9365_CR22","doi-asserted-by":"crossref","unstructured":"Nicolas Boumal. Nonconvex phase synchronization. arXiv preprint arXiv:1601.06114 , 2016.","DOI":"10.1137\/16M105808X"},{"key":"9365_CR23","unstructured":"Nicolas Boumal, P-A Absil, and Coralia Cartis. Global rates of convergence for nonconvex optimization on manifolds. arXiv preprint arXiv:1605.08101 , 2016."},{"key":"9365_CR24","first-page":"1455","volume":"15","author":"Nicolas Boumal","year":"2014","unstructured":"Nicolas Boumal, Bamdev Mishra, P.-A. Absil, and Rodolphe Sepulchre. Manopt, a Matlab toolbox for optimization on manifolds. Journal of Machine Learning Research, 15:1455\u20131459, 2014.","journal-title":"Journal of Machine Learning Research"},{"key":"9365_CR25","unstructured":"Nicolas Boumal, Vladislav Voroninski, and Afonso S. Bandeira. The non-convex burer-monteiro approach works on smooth semidefinite programs. arXiv preprint arXiv:1606.04970 , 2016."},{"issue":"4","key":"9365_CR26","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1107\/S0108767307021903","volume":"63","author":"Oliver Bunk","year":"2007","unstructured":"Oliver Bunk, Ana Diaz, Franz Pfeiffer, Christian David, Bernd Schmitt, Dillip\u00a0K. Satapathy, and J.\u00a0Friso van\u00a0der Veen. Diffractive imaging for periodic samples: retrieving one-dimensional concentration profiles across microfluidic channels. Acta Crystallographica Section A, 63(4):306\u2013314, Jul. 2007.","journal-title":"Acta Crystallographica Section A"},{"key":"9365_CR27","unstructured":"T. Tony Cai, Xiaodong Li, and Zongming Ma. Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow. arXiv preprint arXiv:1506.03382 , 2015."},{"key":"9365_CR28","doi-asserted-by":"crossref","unstructured":"Emmanuel J. Cand\u00e8s, Yonina C. Eldar, Thomas Strohmer, and Vladislav Voroninski. Phase retrieval via matrix completion. SIAM Journal on Imaging Sciences, 6(1), 2013.","DOI":"10.1137\/110848074"},{"issue":"5","key":"9365_CR29","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1007\/s10208-013-9162-z","volume":"14","author":"Emmanuel J Cand\u00e8s","year":"2014","unstructured":"Emmanuel\u00a0J. Cand\u00e8s and Xiaodong Li. Solving quadratic equations via phaselift when there are about as many equations as unknowns. Foundations of Computational Mathematics, 14(5):1017\u20131026, 2014.","journal-title":"Foundations of Computational Mathematics"},{"issue":"2","key":"9365_CR30","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.acha.2014.09.004","volume":"39","author":"Emmanuel J Cand\u00e8s","year":"2015","unstructured":"Emmanuel\u00a0J. Cand\u00e8s, Xiaodong Li, and Mahdi Soltanolkotabi. Phase retrieval from coded diffraction patterns. Applied and Computational Harmonic Analysis, 39(2):277\u2013299, 2015.","journal-title":"Applied and Computational Harmonic Analysis"},{"issue":"4","key":"9365_CR31","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1109\/TIT.2015.2399924","volume":"61","author":"Emmanuel J Cand\u00e8s","year":"2015","unstructured":"Emmanuel\u00a0J. Cand\u00e8s, Xiaodong Li, and Mahdi Soltanolkotabi. Phase retrieval via wirtinger flow: Theory and algorithms. Information Theory, IEEE Transactions on, 61(4):1985\u20132007, April 2015.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"9365_CR32","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1002\/cpa.21432","volume":"66","author":"Emmanuel J Cand\u00e8s","year":"2013","unstructured":"Emmanuel\u00a0J. Cand\u00e8s, Thomas Strohmer, and Vladislav Voroninski. Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming. Communications on Pure and Applied Mathematics, 66(8):1241\u20131274, 2013.","journal-title":"Communications on Pure and Applied Mathematics"},{"issue":"1","key":"9365_CR33","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.jco.2011.06.001","volume":"28","author":"Coralia Cartis","year":"2012","unstructured":"Coralia Cartis, Nicholas\u00a0IM Gould, and Ph\u00a0L Toint. Complexity bounds for second-order optimality in unconstrained optimization. Journal of Complexity, 28(1):93\u2013108, 2012.","journal-title":"Journal of Complexity"},{"issue":"1","key":"9365_CR34","doi-asserted-by":"crossref","first-page":"015005","DOI":"10.1088\/0266-5611\/27\/1\/015005","volume":"27","author":"Anwei Chai","year":"2011","unstructured":"Anwei Chai, Miguel Moscoso, and George Papanicolaou. Array imaging using intensity-only measurements. Inverse Problems, 27(1):015005, 2011.","journal-title":"Inverse Problems"},{"key":"9365_CR35","unstructured":"Yudong Chen and Martin J. Wainwright. Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees. arXiv preprint arXiv:1509.03025 , 2015."},{"key":"9365_CR36","unstructured":"Yuxin Chen and Emmanuel J. Cand\u00e8s. Solving random quadratic systems of equations is nearly as easy as solving linear systems. arXiv preprint arXiv:1505.05114 , 2015."},{"key":"9365_CR37","doi-asserted-by":"crossref","unstructured":"Andrew R. Conn, Nicholas I.M. Gould, and Philippe L. Toint. Trust region methods, volume 1. SIAM, 2000.","DOI":"10.1137\/1.9780898719857"},{"issue":"1","key":"9365_CR38","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0034-4877(06)80008-X","volume":"57","author":"John V Corbett","year":"2006","unstructured":"John\u00a0V. Corbett. The pauli problem, state reconstruction and quantum-real numbers. Reports on Mathematical Physics, 57(1):53\u201368, 2006.","journal-title":"Reports on Mathematical Physics"},{"key":"9365_CR39","unstructured":"Chris Dainty and James R. Fienup. Phase retrieval and image reconstruction for astronomy. Image Recovery: Theory and Application, pages 231\u2013275, 1987."},{"key":"9365_CR40","unstructured":"Armin Eftekhari and Michael B. Wakin. Greed is super: A fast algorithm for super-resolution. arXiv preprint arXiv:1511.03385 , 2015."},{"issue":"15","key":"9365_CR41","doi-asserted-by":"crossref","first-page":"2758","DOI":"10.1364\/AO.21.002758","volume":"21","author":"James R Fienup","year":"1982","unstructured":"James\u00a0R. Fienup. Phase retrieval algorithms: a comparison. Applied Optics, 21(15):2758\u20132769, Aug 1982.","journal-title":"Applied Optics"},{"issue":"1","key":"9365_CR42","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1080\/10556780410001647186","volume":"19","author":"Charles Fortin","year":"2004","unstructured":"Charles Fortin and Henry Wolkowicz. The trust region subproblem and semidefinite programming. Optimization methods and software, 19(1):41\u201367, 2004.","journal-title":"Optimization methods and software"},{"key":"9365_CR43","unstructured":"Bing Gao and Zhiqiang Xu. Gauss-newton method for phase retrieval. arXiv preprint arXiv:1606.08135 , 2016."},{"key":"9365_CR44","unstructured":"Rong Ge, Furong Huang, Chi Jin, and Yang Yuan. Escaping from saddle points\u2014online stochastic gradient for tensor decomposition. In Proceedings of The 28th Conference on Learning Theory, pages 797\u2013842, 2015."},{"key":"9365_CR45","unstructured":"Rong Ge, Jason D. Lee, and Tengyu Ma. Matrix completion has no spurious local minimum. arXiv preprint arXiv:1605.07272 , 2016."},{"key":"9365_CR46","first-page":"237","volume":"35","author":"RW Gerchberg","year":"1972","unstructured":"R.\u00a0W. Gerchberg and W.\u00a0Owen Saxton. A practical algorithm for the determination of the phase from image and diffraction plane pictures. Optik, 35:237\u2013246, 1972.","journal-title":"Optik"},{"issue":"1","key":"9365_CR47","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01588294","volume":"18","author":"Donald Goldfarb","year":"1980","unstructured":"Donald Goldfarb. Curvilinear path steplength algorithms for minimization which use directions of negative curvature. Mathematical programming, 18(1):31\u201340, 1980.","journal-title":"Mathematical programming"},{"key":"9365_CR48","unstructured":"Tom Goldstein and Christoph Studer. Phasemax: Convex phase retrieval via basis pursuit. arXiv preprint arXiv:1610.07531 , 2016."},{"key":"9365_CR49","unstructured":"David Gross, Felix Krahmer, and Richard Kueng. A partial derandomization of phaselift using spherical designs. arXiv preprint arXiv:1310.2267 , 2013."},{"key":"9365_CR50","unstructured":"Paul Hand and Vladislav Voroninski. Compressed sensing from phaseless gaussian measurements via linear programming in the natural parameter space. arXiv preprint arXiv:1611.05985 , 2016."},{"key":"9365_CR51","unstructured":"Paul Hand and Vladislav Voroninski. An elementary proof of convex phase retrieval in the natural parameter space via the linear program phasemax. arXiv preprint arXiv:1611.03935 , 2016."},{"key":"9365_CR52","doi-asserted-by":"crossref","unstructured":"Moritz Hardt. Understanding alternating minimization for matrix completion. In Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on, pages 651\u2013660. IEEE, 2014.","DOI":"10.1109\/FOCS.2014.75"},{"key":"9365_CR53","unstructured":"Moritz Hardt and Mary Wootters. Fast matrix completion without the condition number. In Proceedings of The 27th Conference on Learning Theory, pages 638\u2013678, 2014."},{"issue":"2","key":"9365_CR54","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s00220-013-1671-8","volume":"318","author":"Teiko Heinosaari","year":"2013","unstructured":"Teiko Heinosaari, Luca Mazzarella, and Michael\u00a0M. Wolf. Quantum tomography under prior information. Communications in Mathematical Physics, 318(2):355\u2013374, 2013.","journal-title":"Communications in Mathematical Physics"},{"key":"9365_CR55","unstructured":"Samuel\u00a0B. Hopkins, Tselil Schramm, Jonathan Shi, and David Steurer. Speeding up sum-of-squares for tensor decomposition and planted sparse vectors. arXiv preprint arXiv:1512.02337 , 2015."},{"key":"9365_CR56","unstructured":"Kishore Jaganathan, Yonina\u00a0C. Eldar, and Babak Hassibi. Phase retrieval: An overview of recent developments. arXiv preprint arXiv:1510.07713 , 2015."},{"key":"9365_CR57","doi-asserted-by":"crossref","unstructured":"Kishore Jaganathan, Samet Oymak, and Babak Hassibi. Sparse phase retrieval: Convex algorithms and limitations. In Proceedings of IEEE International Symposium on Information Theory, pages 1022\u20131026. IEEE, 2013.","DOI":"10.1109\/ISIT.2013.6620381"},{"key":"9365_CR58","unstructured":"Prateek Jain, Chi Jin, Sham\u00a0M. Kakade, and Praneeth Netrapalli. Computing matrix squareroot via non convex local search. arXiv preprint arXiv:1507.05854 , 2015."},{"key":"9365_CR59","unstructured":"Prateek Jain and Praneeth Netrapalli. Fast exact matrix completion with finite samples. arXiv preprint arXiv:1411.1087 , 2014."},{"key":"9365_CR60","doi-asserted-by":"crossref","unstructured":"Prateek Jain, Praneeth Netrapalli, and Sujay Sanghavi. Low-rank matrix completion using alternating minimization. In Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, pages 665\u2013674. ACM, 2013.","DOI":"10.1145\/2488608.2488693"},{"key":"9365_CR61","unstructured":"Prateek Jain and Sewoong Oh. Provable tensor factorization with missing data. In Advances in Neural Information Processing Systems, pages 1431\u20131439, 2014."},{"key":"9365_CR62","unstructured":"Kenji Kawaguchi. Deep learning without poor local minima. arXiv preprint arXiv:1605.07110 , 2016."},{"issue":"6","key":"9365_CR63","doi-asserted-by":"crossref","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"Raghunandan H Keshavan","year":"2010","unstructured":"Raghunandan\u00a0H. Keshavan, Andrea Montanari, and Sewoong Oh. Matrix completion from a few entries. Information Theory, IEEE Transactions on, 56(6):2980\u20132998, 2010.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9365_CR64","unstructured":"Ritesh Kolte and Ayfer \u00d6zg\u00fcr. Phase retrieval via incremental truncated wirtinger flow. arXiv preprint arXiv:1606.03196 , 2016."},{"key":"9365_CR65","unstructured":"Ken Kreutz-Delgado. The complex gradient operator and the $$\\mathbb{C}\\mathbb{R}$$ C R -calculus. arXiv preprint arXiv:0906.4835 , 2009."},{"key":"9365_CR66","unstructured":"Jason\u00a0D Lee, Max Simchowitz, Michael\u00a0I Jordan, and Benjamin Recht. Gradient descent converges to minimizers. arXiv preprint arXiv:1602.04915 , 2016."},{"key":"9365_CR67","unstructured":"Kiryung Lee and Marius Junge. RIP-like properties in subsampled blind deconvolution. arXiv preprint arXiv:1511.06146 , 2015."},{"key":"9365_CR68","unstructured":"Kiryung Lee, Yanjun Li, Marius Junge, and Yoram Bresler. Blind recovery of sparse signals from subsampled convolution. arXiv preprint arXiv:1511.06149 , 2015."},{"key":"9365_CR69","unstructured":"Kiryung Lee, Yihong Wu, and Yoram Bresler. Near optimal compressed sensing of sparse rank-one matrices via sparse power factorization. arXiv preprint arXiv:1312.0525 , 2013."},{"issue":"5","key":"9365_CR70","doi-asserted-by":"crossref","first-page":"3019","DOI":"10.1137\/120893707","volume":"45","author":"Xiaodong Li","year":"2013","unstructured":"Xiaodong Li and Vladislav Voroninski. Sparse signal recovery from quadratic measurements via convex programming. SIAM Journal on Mathematical Analysis, 45(5):3019\u20133033, 2013.","journal-title":"SIAM Journal on Mathematical Analysis"},{"issue":"8","key":"9365_CR71","doi-asserted-by":"crossref","first-page":"088303","DOI":"10.1103\/PhysRevLett.89.088303","volume":"89","author":"Jianwei Miao","year":"2002","unstructured":"Jianwei Miao, Tetsuya Ishikawa, Bart Johnson, Erik\u00a0H. Anderson, Barry Lai, and Keith\u00a0O. Hodgson. High resolution 3D X-Ray diffraction microscopy. Phys. Rev. Lett., 89(8):088303, Aug 2002.","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"9365_CR72","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1364\/JOSAA.7.000394","volume":"7","author":"RP Millane","year":"1990","unstructured":"R.\u00a0P. Millane. Phase retrieval in crystallography and optics. Journal of the Optical Society of America A, 7(3):394\u2013411, Mar 1990.","journal-title":"Journal of the Optical Society of America A"},{"issue":"3","key":"9365_CR73","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"Jorge J Mor\u00e9","year":"1983","unstructured":"Jorge\u00a0J. Mor\u00e9 and Danny\u00a0C. Sorensen. Computing a trust region step. SIAM Journal on Scientific and Statistical Computing, 4(3):553\u2013572, 1983.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"9365_CR74","first-page":"1","volume":"1","author":"Mu Cun","year":"2014","unstructured":"Cun Mu, Bo\u00a0Huang, John Wright, and Donald Goldfarb. Square deal: Lower bounds and improved convex relaxations for tensor recovery. Journal of Machine Learning Research, 1:1\u201348, 2014.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"9365_CR75","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Yurii Nesterov","year":"2006","unstructured":"Yurii Nesterov and Boris\u00a0T. Polyak. Cubic regularization of newton method and its global performance. Mathematical Programming, 108(1):177\u2013205, 2006.","journal-title":"Mathematical Programming"},{"key":"9365_CR76","unstructured":"Praneeth Netrapalli, Prateek Jain, and Sujay Sanghavi. Phase retrieval using alternating minimization. In Advances in Neural Information Processing Systems, pages 2796\u20132804, 2013."},{"key":"9365_CR77","unstructured":"Praneeth Netrapalli, Uma\u00a0Naresh. Niranjan, Sujay Sanghavi, Animashree Anandkumar, and Prateek Jain. Non-convex robust PCA. In Advances in Neural Information Processing Systems, pages 1107\u20131115, 2014."},{"key":"9365_CR78","unstructured":"Jorge Nocedal and Stephen Wright. Numerical optimization. Springer Science & Business Media, Berlin, UK,2006."},{"key":"9365_CR79","unstructured":"Henrik Ohlsson, Allen\u00a0Y. Yang, Roy Dong, and S.\u00a0Shankar Sastry. CPRL \u2013 An extension of compressive sensing to the phase retrieval problem. In Advances in Neural Information Processing Systems. 2012."},{"key":"9365_CR80","unstructured":"Henrik Ohlsson, Allen\u00a0Y. Yang, Roy Dong, and S.\u00a0Shankar Sastry. Compressive phase retrieval from squared output measurements via semidefinite programming. arXiv preprint arXiv:1111.6323 , 2013."},{"key":"9365_CR81","unstructured":"Henrik Ohlsson, Allen\u00a0Y. Yang, Michel Verhaegen, and S.\u00a0Shankar Sastry. Quadratic basis pursuit. arXiv preprint arXiv:1301.7002 , 2013."},{"key":"9365_CR82","unstructured":"Samet Oymak, Amin Jalali, Maryam Fazel, Yonina\u00a0C. Eldar, and Babak Hassibi. Simultaneously structured models with application to sparse and low-rank matrices. arXiv preprint arXiv:1212.3753 , 2012."},{"key":"9365_CR83","unstructured":"Ioannis Panageas and Georgios Piliouras. Gradient descent only converges to minimizers: Non-isolated critical points and invariant regions. CoRR, vol. abs\/1605.00405, 2016."},{"key":"9365_CR84","unstructured":"Dohyung Park, Anastasios Kyrillidis, Constantine Caramanis, and Sujay Sanghavi. Non-square matrix sensing without spurious local minima via the burer-monteiro approach. arXiv preprint arXiv:1609.03240 , 2016."},{"key":"9365_CR85","unstructured":"Qing Qu, Ju\u00a0Sun, and John Wright. Finding a sparse vector in a subspace: Linear sparsity using alternating directions. In Advances in Neural Information Processing Systems, pages 3401\u20133409, 2014."},{"key":"9365_CR86","unstructured":"H.\u00a0Reichenbach. In Philosophic foundations of quantum mechanics. University of California Press, 1965."},{"issue":"1","key":"9365_CR87","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF02614438","volume":"77","author":"Franz Rendl","year":"1997","unstructured":"Franz Rendl and Henry Wolkowicz. A semidefinite framework for trust region subproblems with applications to large scale minimization. Mathematical Programming, 77(1):273\u2013299, 1997.","journal-title":"Mathematical Programming"},{"issue":"5","key":"9365_CR88","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1364\/JOSAA.10.001046","volume":"10","author":"W Harrison","year":"1993","unstructured":"W.\u00a0Harrison Robert. Phase problem in crystallography. Journal of the Optical Society of America A, 10(5):1046\u20131055, 1993.","journal-title":"Journal of the Optical Society of America A"},{"key":"9365_CR89","unstructured":"Christopher\u00a0De Sa, Christopher Re, and Kunle Olukotun. Global convergence of stochastic gradient descent for some non-convex matrix problems. In The 32nd International Conference on Machine Learning, volume\u00a037, pages 2332\u20132341, 2015."},{"key":"9365_CR90","unstructured":"Hanie Sedghi and Animashree Anandkumar. Provable tensor methods for learning mixtures of classifiers. arXiv preprint arXiv:1412.3046 , 2014."},{"issue":"4","key":"9365_CR91","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1109\/TSP.2013.2297687","volume":"62","author":"Yoav Shechtman","year":"2014","unstructured":"Yoav Shechtman, Amir Beck, and Yonina\u00a0C. Eldar. GESPAR: Efficient phase retrieval of sparse signals. Signal Processing, IEEE Transactions on, 62(4):928\u2013938, Feb 2014.","journal-title":"Signal Processing, IEEE Transactions on"},{"issue":"3","key":"9365_CR92","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1109\/MSP.2014.2352673","volume":"32","author":"Yoav Shechtman","year":"2015","unstructured":"Yoav Shechtman, Yonina\u00a0C. Eldar, Oren Cohen, Henry\u00a0N. Chapman, Jianwei Miao, and Mordechai Segev. Phase retrieval with application to optical imaging: A contemporary overview. Signal Processing Magazine, IEEE, 32(3):87\u2013109, May 2015.","journal-title":"Signal Processing Magazine, IEEE"},{"key":"9365_CR93","unstructured":"Mahdi Soltanolkotabi. Algorithms and theory for clustering and nonconvex quadratic programming. PhD thesis, Stanford University, 2014."},{"key":"9365_CR94","unstructured":"Daniel Soudry and Yair Carmon. No bad local minima: Data independent training error guarantees for multilayer neural networks. arXiv preprint arXiv:1605.08361 , 2016."},{"key":"9365_CR95","unstructured":"Gilbert\u00a0W. Stewart and Ji-guang Sun. Matrix Perturbation Theory. Academic press, Cambridge, 1990."},{"key":"9365_CR96","unstructured":"Ju\u00a0Sun, Qing Qu, and John Wright. Complete dictionary recovery over the sphere. arXiv preprint arXiv:1504.06785 , 2015."},{"key":"9365_CR97","unstructured":"Ju\u00a0Sun, Qing Qu, and John Wright. When are nonconvex problems not scary? arXiv preprint arXiv:1510.06096 , 2015."},{"key":"9365_CR98","unstructured":"Ruoyu Sun and Zhi-Quan Luo. Guaranteed matrix completion via non-convex factorization. arXiv preprint arXiv:1411.8003 , 2014."},{"key":"9365_CR99","unstructured":"Stephen Tu, Ross Boczar, Mahdi Soltanolkotabi, and Benjamin Recht. Low-rank solutions of linear matrix equations via procrustes flow. arXiv preprint arXiv:1507.03566 , 2015."},{"key":"9365_CR100","unstructured":"Stephen A. Vavasis and Richard Zippel. Proving polynomial-time for sphere-constrained quadratic programming. Technical report, Cornell University, 1990."},{"key":"9365_CR101","doi-asserted-by":"crossref","unstructured":"Roman Vershynin. Introduction to the non-asymptotic analysis of random matrices. In Yonina\u00a0C. Eldar and Gitta Kutyniok, editors, Compressed Sensing, pages 210\u2013268. Cambridge University Press, 2012.","DOI":"10.1017\/CBO9780511794308.006"},{"key":"9365_CR102","unstructured":"Vladislav Voroninski and Zhiqiang Xu. A strong restricted isometry property, with an application to phaseless compressed sensing. arXiv preprint arXiv:1404.3811 , 2014."},{"key":"9365_CR103","unstructured":"Ir\u00e8ne Waldspurger. Phase retrieval with random gaussian sensing vectors by alternating projections. arXiv preprint arXiv:1609.03088 , 2016."},{"issue":"1\u20132","key":"9365_CR104","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10107-013-0738-9","volume":"149","author":"Ir\u00e9ne Waldspurger","year":"2015","unstructured":"Ir\u00e9ne Waldspurger, Alexandre d Aspremont, and St\u00e9phane Mallat. Phase recovery, maxcut and complex semidefinite programming. Mathematical Programming, 149(1-2):47\u201381, 2015.","journal-title":"Mathematical Programming"},{"issue":"1","key":"9365_CR105","first-page":"41","volume":"10","author":"Adriaan Walther","year":"1963","unstructured":"Adriaan Walther. The question of phase retrieval in optics. Journal of Modern Optics, 10(1):41\u201349, 1963.","journal-title":"Journal of Modern Optics"},{"key":"9365_CR106","doi-asserted-by":"crossref","unstructured":"Gang Wang, Georgios\u00a0B Giannakis, and Yonina\u00a0C Eldar. Solving systems of random quadratic equations via truncated amplitude flow. arXiv preprint, 2016.","DOI":"10.23919\/EUSIPCO.2017.8081443"},{"key":"9365_CR107","unstructured":"Ke\u00a0Wei, Jian-Feng Cai, Tony\u00a0F. Chan, and Shingyu Leung. Guarantees of Riemannian optimization for low rank matrix recovery. arXiv preprint arXiv:1511.01562 , 2015."},{"key":"9365_CR108","unstructured":"Chris\u00a0D. White, Rachel Ward, and Sujay Sanghavi. The local convexity of solving quadratic equations. arXiv preprint arXiv:1506.07868 , 2015."},{"issue":"1\u20133","key":"9365_CR109","first-page":"285","volume":"56","author":"Yinyu Ye","year":"1992","unstructured":"Yinyu Ye. On affine scaling algorithms for nonconvex quadratic programming. Mathematical Programming, 56(1-3):285\u2013300, 1992.","journal-title":"Mathematical Programming"},{"key":"9365_CR110","unstructured":"Xinyang Yi, Constantine Caramanis, and Sujay Sanghavi. Alternating minimization for mixed linear regression. arXiv preprint arXiv:1310.3745 , 2013."},{"key":"9365_CR111","unstructured":"Huishuai Zhang, Yuejie Chi, and Yingbin Liang. Provable non-convex phase retrieval with outliers: Median truncated wirtinger flow. arXiv preprint arXiv:1603.03805 , 2016."},{"key":"9365_CR112","unstructured":"Huishuai Zhang and Yingbin Liang. Reshaped wirtinger flow for solving quadratic systems of equations. arXiv preprint arXiv:1605.07719 , 2016."},{"key":"9365_CR113","unstructured":"Qinqing Zheng and John Lafferty. A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements. arXiv preprint arXiv:1506.06081 , 2015."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-017-9365-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-017-9365-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-017-9365-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T22:08:45Z","timestamp":1692914925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-017-9365-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,14]]},"references-count":113,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["9365"],"URL":"https:\/\/doi.org\/10.1007\/s10208-017-9365-9","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,14]]}}}