Sparse signal recovery from quadratic measurements via convex programming

SIAM Journal on Mathematical Analysis

Volumn 45, Issue 5, 2013, Pages 3019-3033

  Li, Xiaodong ^a   Voroninski, Vladislav ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

1 minimization; Approximate dual certificate; Compressed sensing; Golfing scheme; KKT condition; PhaseLift; Random matrices with IID rows; Shor's SDP relaxation; Trace minimization

Indexed keywords

1-MINIMIZATION; APPROXIMATE DUAL; GOLFING SCHEME; KKT CONDITION; PHASELIFT; RANDOM MATRICES; SHOR'S SDP-RELAXATION; TRACE MINIMIZATION;

COMPRESSED SENSING; CONVEX OPTIMIZATION; RELAXATION PROCESSES;

SIGNAL RECONSTRUCTION;

EID: 84891329056     PISSN: 00361410     EISSN: 10957111     Source Type: Journal    
DOI: 10.1137/120893707     Document Type: Article

References (15)

1. R. Balan, P. G. Casazza, and D. Edidin, On signal reconstruction without noisy phase, Appl. Comput. Harmon. Anal., 20 (2006), pp. 345-356.
2. P. Biswas and Y. Ye, Semidefinite programming for ad hoc wireless sensor network localization, Proceedings of the Third International Symposium on Information Processing in Sensor Networks, ACM, New York, 2004, pp. 46-54.
3. E. Candés, J. Romberg, and T. Tao, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inform. Theory, 52 (2006), pp. 489-509.
4. E. J. Candés and X. Li, Solving Quadratic Equations via PhaseLift when There Are About as Many Equations as Unknowns, Found. Comput. Math., 2013, DOI: 10.1007/s10208-013-9162-z.
5. E. J. Candés, Y. Eldar, T. Strohmer, and V. Voroninski, Phase retrieval via matrix completion, SIAM J. Imaging Sci., 6 (2013), pp. 199-225.
6. E. J. Candés, T. Strohmer, and V. Voroninski, PhaseLift: Exact and stable signal recovery from magnitude measurements via convex programming, Comm. Pure Appl. Math., 66 (2011), pp. 1241-1274.
7. A. Chai, M. Moscoso, and G. Papanicolaou, Array imaging using intensity-only measurements, Inverse Problems, 27 (2011), 015005.
8. D. Donoho, Compressed sensing, IEEE Trans. Inform. Theory, 52 (2006), pp. 1289-1306.
9. D. Gross, Recovering low-rank matrices from few coefficients in any basis, IEEE Trans. Inform. Theory, 57 (2011), pp. 1548-1566.
10. P. Hand, Conditions for Existence of Dual Certicates in Rank One Semidefinite Problems, arXiv:1303.1598v2, 2013.
11. K. Jaganathan, S. Oymak, and B. Hassibi, Recovery of sparse 1-d signals from the magnitudes of their fourier transform, Proceedings of the IEEE International Symposium on Information Theory, 2012.
12. H. Ohlsson, A. Y. Yang, R. Dong, and S. S. Sastry, Compressive Phase Retrieval from Squared Output Measurements via Semidefinite Programming, arXiv:1111.6323, 2011.
13. Y. Shechtman, Y. Eldar, A. Szameit, and M. Segev, Sparsity based sub-wavelength imaging with partially incoherent light via quadratic compressed sensing, Optics Express, 19 (2011), pp. 14807-14822.
14. A. M.-C. So and Y. Ye, Theory of semidefinite programming for sensor network localization, Math. Program., 109 (2007), pp. 364-387.
15. R. Vershynin, Introduction to the non-asymptotic analysis of random matrices, in Compressed Sensing: Theory and Applications, Y. C. Eldar and G. Kutyniok, eds., Cambridge University Press, Cambridge, UK, 2012, pp. 210-268.