PhaseLift: Exact and stable signal recovery from magnitude measurements via convex programming

Communications on Pure and Applied Mathematics

Volumn 66, Issue 8, 2013, Pages 1241-1274

  Candès, Emmanuel J ^a   Strohmer, Thomas ^b   Voroninski, Vladislav ^c  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84878420841     PISSN: 00103640     EISSN: 10970312     Source Type: Journal    
DOI: 10.1002/cpa.21432     Document Type: Article

References (21)

1. Balan, R. ; Bodmann, B. G. ; Casazza, P. G. ; Edidin, D. Fast algorithms for signal reconstruction without phase. Proc. SPIE 6701 (2007), Wavelets XII, 67011L-67011L-9. doi: 10.1117/12.731117
2. Balan, R. ; Bodmann, B. G. ; Casazza, P. G. ; Edidin, D. Painless reconstruction from magnitudes of frame coefficients. J. Fourier Anal. Appl. 15 (2009), no. 4, 488-501.
3. Balan, R. ; Casazza, P. ; Edidin, D. On signal reconstruction without noisy phase. Appl. Comp. Harm. Anal. 20 (2006), 345-356.
4. Beck, C. ; D'Andrea, R. Computational study and comparisons of LFT reducibilitymethods. Proceedings of the 1998 American Control Conference (Philadelphia, 1998(, vol. 2, 1013-1017. doi: 10.1109/ACC.1998.703562
5. Becker, S. R. ; Candès, E. ; Grant, M. C. Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Comput. 3 (2011), no. 3, 165-218.
6. Berinde, R. ; Gilbert, A. C. ; Indyk, P. ; Karloff, H. ; Strauss, M. J. Combining geometry and combinatorics: A unified approach to sparse signal recovery. 2008 46th Annual Allerton Conference on Communication, Control, and Computing (Urbana-Champaign, 2008), 798-805. doi: 10.1109/ALLERTON.2008.4797639
7. Candès, E. J. ; Eldar, Y. ; Strohmer, T. ; Voroninski, V. Phase retrieval via matrix completion. SIAM Journal of Imaging Sciences, forthcoming.
8. Candès, E. J. ; Plan, Y. Matrix completion with noise. Proc. IEEE 98 (2010), no. 6, 925-936.
9. Candès, E. J. ; Tao, T. Decoding by linear programming. IEEE Trans. Inform. Theory 51 (2005), no. 12, 4203-4215.
10. Chai, A. ; Moscoso, M. ; Papanicolaou, G. Array imaging using intensity-only measurements. Inverse Problems 27 (2011), no. 1, 015005, 16 pp.
11. Davis, C. ; Kahan, W. M. The rotation of eigenvectors by a perturbation. III. SIAM J. Numer. Anal. 7 (1970), 1-46.
12. Finkelstein, J. Pure-state informationally complete and "really" complete measurements. Phys. Rev. A (3) 70 (2004), no. 5, part A, 052107, 3 pp.
13. Gross, D. Recovering low-rank matrices from few coefficients in anybasis. IEEE Trans. Inform. Theory 57 (2011), no. 3, 1548-1566.
14. Gross, D. ; Liu, Y.-K. ; Flammia, S. T. ; Becker, S. ; Eisert, J. Quantum-state tomography via compressed sensing. Phys. Rev. Lett. 105 (2010), no. 15, 4 pp. doi: 10.1103/PhysRevLett.105.150401
15. Hurt, N. E. Phase retrieval and zero crossings. Mathematics and Its Applications, 52. Kluwer, Dordrecht, 1989.
16. Klibanov, M. V. ; Sacks, P. E. ; Tikhonravov, A. V. The phase retrieval problem. Inverse problems 11 (1995), no. 1, 1-28.
17. Lu, Y. ; Vetterli, M. Sparse spectral factorization: Unicity andreconstruction algorithms. IEEE International Conference on Acoustics, Speech and Signal Processing (Prague, 2011), 5976-5979.
18. Mesbahi, M. ; Papavassilopoulos, G. P. On the rank minimizationproblem over a positive semidefinite linear matrix inequality. IEEE Trans. Automat. Control 42 (1997), no. 2, 239-243.
19. Rockafellar, R. Convex analysis. Princeton Mathematical Series, 28. Princeton University Press, Princeton, N. J.
20. Sahinoglou, H. ; Cabrera, S. D. On phase retrieval of finite-lengthsequences using the initial time sample. IEEE Transactions on Circuits and Systems 38 (1991), no. 5, 954-958.
21. Vershynin, R. Introduction to the non-asymptotic analysis of randommatrices. Compressed Sensing: Theory and Applications. Edited by Y. C.Eldar and G.Kutyniok. Cambridge University Press, Cambridge New York, 2010.