An Overview of Low-Rank Matrix Recovery from Incomplete Observations

IEEE Journal on Selected Topics in Signal Processing

Volumn 10, Issue 4, 2016, Pages 608-622

  Davenport, Mark A ^a   Romberg, Justin ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS; RECOVERY;

INCOMPLETE OBSERVATION; LOW-RANK MATRICES; LOW-RANK MATRIX RECOVERIES; MATRIX RECOVERY; MODERN TECHNIQUES; RANK STRUCTURE; THEORETICAL GUARANTEES;

SIGNAL PROCESSING;

EID: 84970998198     PISSN: 19324553     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSTSP.2016.2539100     Document Type: Review

References (141)

1. M. Davies and Y. Eldar, "Rank awareness in joint sparse recovery, " IEEE Trans. Inf. Theory, vol. 58, no. 2, pp. 1135-1146, Feb. 2012.
2. A. Ahmed and J. Romberg, "Compressive multiplexing of correlated signals, " IEEE Trans. Inf. Theory, vol. 61, no. 1, pp. 479-498, Jan. 2015.
3. Z. Liu and L. Vandenberghe, "Interior-point method for nuclear norm approximation with application to system identification, " SIAM J. Matrix Anal. Appl., vol. 31, no. 3, pp. 1235-1256, 2009.
4. N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications, " Combinatorica, vol. 15, no. 2, pp. 215-245, 1995.
5. I. Borg and P. Groenen, Modern Multidimensional Scaling. New York, NY, USA: Springer, 2010.
6. A. So and Y. Ye, "Theory of semidefinite programming for sensor network localization, " Math. Program. A, B, vol. 109, no. 2, pp. 367-384, 2007.
7. P. Biswas, T.-C. Lian, T.-C. Wang, and Y. Ye, "Semidefinite programming based algorithms for sensor network localization, " ACM Trans. Sens. Netw., vol. 2, no. 2, pp. 188-220, 2006.
8. A. Singer, "A remark on global positioning from local distances, " Proc. Nat. Acad. Sci. USA, vol. 105, no. 28, pp. 9507-9511, 2008.
9. A. Singer and M. Cucuringu, "Uniqueness of low-rank matrix completion by rigidity theory, " SIAM J. Matrix Anal. Appl., vol. 31, no. 4, pp. 1621-1641, 2010.
10. W. van der Linden and R. Hambleton, Eds., Handbook of Modern Item Response Theory. Berlin, Germany: Springer-Verlag, 2010.
11. A. Lan, A. Waters, C. Studer, and R. Baraniuk, "Sparse factor analysis for learning and content analytics, " J. Mach. Learn. Res., vol. 15, pp. 1959-2008, 2014.
12. D. Goldberg, D. Nichols, B. Oki, and D. Terry, "Using collaborative filtering to weave an information tapestry, " Commun. ACM, vol. 35, no. 12, pp. 61-70, 1992.
13. N. Srebro, "Learning with matrix factorizations, " Ph.D. dissertation, Dept. Electr. Eng. Comput. Sci., MIT, Cambridge, MA, USA, 2004.
14. J. Rennie and N. Srebro, "Fast maximum margin matrix factorization for collaborative prediction, " in Proc. Int. Conf. Mach. Learn. (ICML), Bonn, Germany, Aug. 2005, pp. 713-719.
15. K. Pearson, "On lines and planes of closest fit to a system of points in space, " Philosoph. Mag., vol. 2, pp. 557-572, 1901.
16. H. Hotelling, "Analysis of a complex of statistical variables into principal components, " J. Educ. Psychol., vol. 24, pp. 417-441, 498-520, 1933.
17. A. Argyriou, T. Evgeniou, and M. Pontil, "Convex multi-Task feature learning, " Mach. Learn., vol. 73, no. 3, pp. 243-272, 2008.
18. G. Obozinski, B. Taskar, and M. Jordan, "Joint covariate selection and joint subspace selection for multiple classification problems, " Stat. Comput., vol. 20, no. 2, pp. 231-252, 2010.
19. S. Dumais, "Latent semantic analysis, " Ann. Rev. Inf. Sci. Techn., vol. 38, no. 1, pp. 188-230, 2004.
20. D. Blei, "Probabilistic topic models, " Commun. ACM, vol. 55, no. 4, pp. 77-84, 2012.
21. D. Gross, Y.-K. Liu, S. Flammia, S. Becker, and J. Eisert, "Quantum state tomography via compressed sensing, " Phys. Rev. Lett., vol. 105, no. 15, p. 150401, 2010.
22. D. Donoho, "Compressed sensing, " IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
23. E. Candès, "Compressive sampling, " in Proc. Int. Congr .Math., Madrid, Spain, Aug. 2006, pp. 1433-1452.
24. M. Davenport, M. Duarte, Y. Eldar, and G. Kutyniok, "Introduction to compressed sensing, " in Compressed Sensing: Theory and Applications, Y. Eldar and G. Kutyniok, Eds. Cambridge, U.K.: Cambridge Univ. Press, 2012.
25. D. Gross, "Recovering low-rank matrices from few coefficients in any basis, " IEEE Trans. Inf. Theory, vol. 57, no. 3, pp. 1548-1566, Mar. 2011.
26. E. Candès and B. Recht, "Exact matrix completion via convex optimization, " Found. Comput. Math., vol. 9, no. 6, pp. 717-772, 2009.
27. E. Candès and T. Tao, "The power of convex relaxation: Near-optimal matrix completion, " IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2053-2080, May 2010.
28. R. Keshavan, A. Montanari, and S. Oh, "Matrix completion from a few entries, " IEEE Trans. Inf. Theory, vol. 56, no. 6, pp. 2980-2998, Jun. 2010.
29. B. Recht, "A simpler approach to matrix completion, " J. Mach. Learn. Res., vol. 12, pp. 3413-3430, 2011.
30. B. Recht, M. Fazel, and P. Parrilo, "Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization, " SIAM Rev., vol. 52, no. 3, pp. 471-501, 2010.
31. F. Krahmer and H. Rauhut, "Structured random measurements in signal processing, " GAMM-Mitt., vol. 37, no. 2, pp. 217-238, 2014.
32. A. Ahmed and J. Romberg, "Compressive sampling of ensembles of correlated signals, " arxiv:1501.06654, 2015.
33. G. Tang and B. Recht, "Convex blind deconvolution with random masks, " in Proc. Classical Opt., Kohala Coast, HI, USA, Jun. 2014.
34. S. Bahmani and J. Romberg, "Lifting for blind deconvolution in random mask imaging: Identifiability and convex relaxation, " arxiv:1501.00046, 2015.
35. R. Horn and C. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985.
36. M. Fazel, "Matrix rank minimization with applications, " Ph.D. dissertation, Stanford Univ., Stanford, CA, USA, Mar. 2002.
37. L. Hogben, Ed., Handbook of Linear Algebra, 2nd ed. London, U.K.: Chapman & Hall/CRC Press, 2013.
38. A. Talwalkar, S. Kumar, M. Mohri, and H. Rowley, "Large-scale SVD and manifold learning, " J. Mach. Learn. Res., vol. 14, pp. 3129-3152, 2013.
39. N. Halko, P. Martinsson, and J. Tropp, "Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions, " SIAM Rev., vol. 53, no. 2, pp. 217-288, 2011.
40. M. Mahoney, Randomized Algorithms for Matrices and Data. Boston, MA, USA: NOW, 2011, vol. 3.
41. N. Parikh and S. Boyd, Proximal Algorithms. Boston, MA, USA: NOW, 2013.
42. P. Combettes and J.-C. Pesquet, "Proximal splitting methods in signal processing, " in Fixed-Point Algorithms for Inverse Problems in Science and Engineering, H. Bauschke, R. Burachik, P. Combettes, V. Elser, D. Luke, and H. Wolkowicz, Eds. New York, NY, USA: Springer, 2011.
43. J.-F. Cai, E. Candès, and Z. Shen, "A singular value thresholding algorithm for matrix completion, " SIAM J. Optim., vol. 20, no. 4, pp. 1956-1982, 2010.
44. A. Beck and M. Teboulle, "A fast iterative shrinkage-Thresholding algorithm for linear inverse problems, " SIAM J. Imag. Sci., vol. 2, no. 1, pp. 183-202, 2009.
45. R. Mazumder, T. Hastie, and R. Tibshirani, "Spectral regularization algorithms for learning large incomplete matrices, " J. Mach. Learn. Res., vol. 11, pp. 2287-2322, 2010.
46. T. Zhou and D. Tao, "GoDec: Randomized low-rank and sparse matrix decomposition in noisy case, " in Proc. Int. Conf. Mach. Learn. (ICML), Bellevue, WA, USA, Jun. 2011, pp. 33-40.
47. S. Burer and R. Moneteiro, "Local minima and convergence in low-rank semidefinite programming, " Math. Program., vol. 103, no. 3, pp. 427-444, 2005.
48. S. Burer and R. Monteiro, "A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, " Math. Program. B, vol. 95, pp. 329-357, 2003.
49. B. Recht and C. Ré, "Parallel stochastic gradient algorithms for largescale matrix completion, " Math. Program. Comput., vol. 5, no. 2, pp. 201-226, 2013.
50. P. Jain, R. Meka, and I. Dhillon, "Guaranteed rank minimization via singular value projection, " in Proc. Adv. Neural Process. Syst. (NIPS), Vancouver, BC, Canada, Dec. 2010, pp. 937-945.
51. J. Tanner and K. Wei, "Normalized iterative hard thresholding for matrix completion, " SIAM J. Sci. Comput., vol. 35, no. 5, pp. S104-S125, 2013.
52. H. Simon and H. Zha, "Low-rank matrix approximation using the Lanczos bidiagonalization process with applications, " SIAM J. Sci. Comput., vol. 21, no. 6, pp. 2257-2274, 2000.
53. R. Larsen. PROPACK Software Package, 1998 [Online]. Available: http://sun.stanford.edu/~rmunk/PROPACK/
54. Y. Koren, R. Bell, and C. Volinsky, "Matrix factorization techniques for recommender systems, " Computer, vol. 42, no. 8, pp. 30-37, 2009.
55. J. Haldar and D. Hernando, "Rank-constrained solutions to linear matrix equations using power factorization, " IEEE Signal Process. Lett., vol. 16, no. 7, pp. 584-587, Jul. 2009.
56. P. Jain, P. Netrapalli, and S. Sanghavi, "Low-rank matrix completion using alternating minimization, " in Proc. ACM Symp. Theory Comput. (STOC), Palo Alto, CA, USA, Jun. 2013, pp. 665-674.
57. R. Keshavan, "Efficient algorithms for collaborative filtering, " Ph.D. dissertation, Dept. Electr. Eng., Stanford Univ., Stanford, CA, USA, 2012.
58. H. Kim and H. Park, "Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method, " SIAM J. Matrix Anal. Appl., vol. 30, no. 2, pp. 713-730, 2008.
59. H. Zou, T. Hastie, and R. Tibshirani, "Sparse principal component analysis, " J. Comput. Graphical Stat., vol. 15, no. 2, pp. 262-286, 2006.
60. B. Olshausen and D. Field, "Natural image statistics and efficient coding, " Neural Comput., vol. 7, no. 2, pp. 333-339, 1996.
61. M. Lewicki and B. Olshausen, "A probabilistic framework for the adaptation and comparison of image codes, " J. Opt. Soc. Amer. A, vol. 16, no. 7, pp. 1587-1601, 1999.
62. K. Lee, Y. Wu, and Y. Bresler, "Near optimal compressed sensing of sparse rank-one matrices via sparse power factorization, " arXiv:1312.0525, 2013.
63. A. Agarwal, A. Anandkumar, P. Jain, P. Netrapalli, and R. Tandon, "Learning sparsely used overcomplete dictionaries, " J. Mach. Learn. Res., vol. 35, pp. 1-15, 2014.
64. S. Tu, R. Boczar, M. Soltanolkotabi, and B. Recht, "Low-rank solutions of linear matrix equations via Procrustes flow, " arxiv:1507.03566, 2015.
65. S. Bhojanapalli, A. Kyrillidis, and S. Sanghavi, "Dropping convexity for faster semi-definite optimization, " arxiv:1509.03917, 2015.
66. K. Clarkson, "Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm, " ACM Trans. Algorithms, vol. 6, no. 4, 2010, Art. no. 53.
67. M. Jaggi, "Revisiting Frank-Wolfe: Projection-free sparse convex optimization, " in Proc. Int. Conf. Mach. Learn. (ICML), Atlanta, GA, USA, Jun. 2013, pp. 427-435.
68. M. Jaggi and M. Sulovský, "A simple algorithm for nuclear norm regularized problems, " in Proc. Int. Conf. Mach. Learn. (ICML), Haifa, Israel, Jun. 2010, pp. 471-478.
69. M. Fornasier, H. Rauhut, and R. Ward, "Low-rank matrix recovery via iteratively reweighted least squares minimization, " SIAM J. Optim., vol. 21, no. 4, pp. 1614-1640, 2011.
70. K. Mohan and M. Fazel, "Iterative reweighted algorithms for matrix rank minimization, " J. Mach. Learn. Res., no. 11, pp. 3441-3473, 2012.
71. M. Fornasier, S. Peter, H. Rauhut, and S. Worm, "Conjugate gradient acceleration of iteratively re-weighted least squares methods, " arxiv:1509.04063, 2015.
72. N. Srebro, J. Rennie, and T. Jaakkola, "Maximum margin matrix factorization, " in Proc. Adv. Neural Process. Syst. (NIPS), Vancouver, BC, Canada, Dec. 2004, pp. 1329-1336.
73. N. Srebro and A. Shraibman, "Rank, trace-norm and max-norm, " in Proc. Conf. Learn. Theory (COLT), Bertinoro, Italy, Jun. 2005, pp. 545-560.
74. M. Fazel, H. Hindi, and S. Boyd, "Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices, " in Proc. Amer. Control Conf., Denver, CO, USA, Jun. 2003, pp. 2156-2162.
75. K. Lee and Y. Bresler, "ADMiRA: Atomic decomposition for minimum rank approximation, " IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4402-4416, Sep. 2010.
76. W. Dai, O. Milenkovic, and E. Kerman, "Subspace evolution and transfer (SET) for low-rank matrix completion, " IEEE Trans. Signal Process., vol. 59, no. 7, pp. 3120-3132, Jul. 2011.
77. E. Candès and Y. Plan, "Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements, " IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 2342-2359, Apr. 2011.
78. R. Vershynin, "Introduction to the non-Asymptotic analysis of random matrices, " in Compressed Sensing: Theory and Applications, Y. Eldar and G. Kutyniok, Eds. Cambridge, U.K.: Cambridge Univ. Press, 2012.
79. B. Laurent and P. Massart, "Adaptive estimation of a quadratic functional by model selection, " Ann. Statist., vol. 28, no. 5, pp. 1302-1338, 2000.
80. S. Oymak, K. Mohan, M. Fazel, and B. Hassibi, "A simplified approach to recovery conditions for low rank matrices, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), St. Petersburg, Russia, Aug. 2011, pp. 2318-2322.
81. T. Cai and A. Zhang, "Compressed sensing and affine rank minimization under restricted isometry, " IEEE Trans. Signal Process., vol. 61, no. 13, pp. 3279-3290, Jul. 2013.
82. V. Chandrasekaran, B. Recht, P. Parrilo, and A. Willsky, "The convex geometry of linear inverse problems, " Found. Comput. Math., vol. 12, no. 6, pp. 805-849, 2012.
83. S. Oymak and B. Hassibi, "Tight recovery thresholds and robustness analysis for nuclear norm minimization, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), St. Petersburg, Russia, Aug. 2011, pp. 2323-2327.
84. D. Amelunxen, M. Lotz, M. McCoy, and J. Tropp, "Living on the edge: Phase transitions in convex programs with random data, " Inf. Inference, vol. 3, no. 3, pp. 224-294, 2014.
85. Y. Gordon, "On Milmans inequality and random subspaces which escape through a mesh in Rn, " in Geometric Aspects of Functional Analysis (1986/1987). New York, NY, USA: Springer, 1988, vol. 1317, pp. 84-106.
86. Y. Chen, "Incoherence-optimal matrix completion, " IEEE Trans. Inf. Theory, vol. 61, no. 5, pp. 2909-2923, May 2015.
87. Y. Chen, S. Bhojanapalli, S. Sanghavi, and R. Ward, "Completing any low-rank matrix, provably, " J. Mach. Learn. Res., vol. 16, pp. 2999-3034, 2015.
88. R. Keshavan, A. Montanari, and S. Oh, "Matrix completion from noisy entries, " J. Mach. Learn. Res., vol. 11, pp. 2057-2078, 2010.
89. S. Negahban and M. Wainwright, "Restricted strong convexity and weighted matrix completion: Optimal bounds with noise, " J. Mach. Learn. Res., vol. 13, pp. 1665-1697, 2012.
90. V. Koltchinskii, K. Lounici, and A. Tsybakov, "Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion, " Ann. Stat., vol. 39, no. 5, pp. 2302-2329, 2011.
91. E. Candès and Y. Plan, "Matrix completion with noise, " Proc. IEEE, vol. 98, no. 6, pp. 925-936, Jun. 2010.
92. A. Rohde and A. Tsybakov, "Estimation of high-dimensional low-rank matrices, " Ann. Stat., vol. 39, no. 2, pp. 887-930, 2011.
93. O. Klopp, "Rank penalized estimators for high-dimensional matrices, " Electron. J. Stat., vol. 5, pp. 1161-1183, 2011.
94. S. Gaïffas and G. Lecué, "Sharp oracle inequalities for high-dimensional matrix prediction, " IEEE Trans. Inf. Theory, vol. 57, no. 10, pp. 6942-6957, Oct. 2011.
95. S. Gaïffas and O. Klopp, "High dimensional matrix estimation with unknown variance of the noise, " arxiv:1112.3055, 2011.
96. V. Koltchinskii, "Von Neumann entropy penalization and low-rank matrix estimation, " Ann. Stat., vol. 39, no. 6, pp. 2936-2973, 2012.
97. R. Ahlswede and A. Winter, "Strong converse for identification via quantum channels, " IEEE Trans. Inf. Theory, vol. 48, no. 3, pp. 569-579, Mar. 2002.
98. J. Tropp, "User-friendly tail bounds for sums of random matrices, " Found. Comput. Math., vol. 12, no. 4, pp. 389-434, 2012.
99. M. Hardt, "Understanding alternating minimization for matrix completion, " in Proc. IEEE Symp. Found. Comput. Sci. (FOCS), Philadelphia, PA, USA, Oct. 2014, pp. 651-660.
100. M. Hardt and M. Wootters, "Fast matrix completion without the condition number, " in Proc. Conf. Learn. Theory, Barcelona, Spain, Jun. 2014, pp. 638-678.
101. M. Davenport, Y. Plan, E. van den Berg, and M. Wootters, "1-bit matrix completion, " Inf. Inference, vol. 3, no. 3, pp. 189-223, 2014.
102. T. Cai and W. Zhou, "A max-norm constrained minimization approach to 1-bit matrix completion, " J. Mach. Learn. Res., vol. 14, no. 1, pp. 3619-3647, 2013.
103. S. Bhaskar and A. Javanmard, "1-Bit matrix completion under exact low-rank constraint, " in Proc. IEEE Conf. Inf. Sci. Syst. (CISS), Baltimore, MD, USA, Mar. 2015, pp. 1-6.
104. A. Soni, S. Jain, J. Haupt, and S. Gonella, "Noisy matrix completion under sparse factor models, " arxiv:1411.0282, 2014.
105. A. Karbasi and S. Oh, "Robust localization from incomplete local information, " IEEE/ACM Trans. Netw., vol. 21, no. 4, pp. 1131-1144, Aug. 2013.
106. A. Moshtaghpour, L. Jacques, V. Cambareri, K. Degraux, and C. De Vleeschouwer, "Consistent basis pursuit for signal and matrix estimates in quantized compressed sensing, " IEEE Signal Process. Lett., vol. 23, no. 1, pp. 25-29, Jan. 2016.
107. H. David, The Method of Paired Comparisons. London, U.K.: Griffin, 1963.
108. Y. Lu and S. Negahban, "Individualized rank aggregration using nuclear norm regularization, " arxiv:1410.0860, 2014.
109. D. Park, J. Neeman, J. Zhang, S. Sanghavi, and I. Dhillon, "Preference completion: Large-scale collaborative ranking form pairwise comparisons, " in Proc. Int. Conf. Machine Learning (ICML), Lille, France, Jul. 2015, pp. 1907-1916.
110. S. Oh, K. Thekumparampil, and J. Xu, "Collaboratively learning preferences from ordinal data, " in Proc. Adv. in Neural Processing Systems (NIPS), Montréal, QC, Québec, Dec. 2015, pp. 1900-1908.
111. J. Lafond, O. Klopp, E. Moulines, and J. Salmon, "Probabilistic lowrank matrix completion on finite alphabets, " in Proc. Adv. Neural Process. Syst. (NIPS), Montréal, QC, Québec, Dec. 2014, pp. 1727-1735.
112. O. Klopp, J. Lafond, E. Moulines, and J. Salmon, "Adaptive multinomial matrix completion, " Electron. J. Stat., vol. 9, no. 2, pp. 2950-2975, 2015.
113. Y. Cao and Y. Xie, "Categorical matrix completion, " in Proc. IEEE Int. Work. Comput. Adv. Multi-Sensor Adapt. Processing (CAMSAP), Cancun, Mexico, Dec., 2015, pp. 369-372.
114. Y. Cao and Y. Xie, "Poisson matrix recovery and completion, " IEEE Trans. Signal Process., vol. 64, no. 6, pp. 1609-1620, Mar. 2016.
115. S. Gunasekar, P. Ravikumar, and J. Ghosh, "Exponential family matrix completion under structural constraints, " in Proc. Int. Conf. Mach. Learn. (ICML), Beijing, China, Jun. 2014, pp. 3964-3976.
116. J. Lafond, "Low rank matrix completion with exponential family noise, " in Proc. Conf. Learn. Theroy (COLT), Paris, France, Jul. 2015, pp. 1224-1243.
117. Y. Kabashima, F. Krzakala, M. Mézard, A. Sakata, and L. Zdeborová, "Phase transitions and sample complexity in Bayes-optimal matrix factorization, " arxiv:1402.1298, 2014.
118. R. Balan, P. Casazza, and D. Edidin, "On signal reconstruction without phase, " Appl. Comput. Harmon. Anal., vol. 20, pp. 345-356, 2006.
119. E. Candès, T. Strohmer, and V. Voroninski, "PhaseLift: Exact and stable signal recovery from magnitude measurements via convex programming, " Commun. Pure Appl. Math., vol. 66, no. 8, pp. 1241-1274, 2013.
120. L. Demanet and P. Hand, "Stable optimizationless recovery from phaseless linear measurements, " J. Fourier Anal. Appl., vol. 20, pp. 199-221, 2014.
121. E. Candès and X. Li, "Solving quadratic equations via PhaseLift when there are about as many equations as unknowns, " Found. Comput. Math., vol. 14, pp. 1017-1026, 2014.
122. R. Kueng, H. Rauhut, and U. Terstiege, "Low rank matrix recovery from rank one measurements, " arxiv:1410.6913, 2014.
123. Y. Chen, Y. Chi, and A. Goldsmith, "Exact and stable covariance estimation from quadratic sampling via convex programming, " IEEE Trans. Inf. Theory, vol. 61, no. 7, pp. 4034-4059, Jul. 2015.
124. E. Candès, X. Li, and M. Soltanolkotabi, "Phase retrieval from coded diffraction patterns, " Appl. Comput. Harmon. Anal., vol. 39, no. 2, pp. 277-299, 2015.
125. Y. Eldar, P. Sidorenko, D. Mixon, S. Barel, and O. Cohen, "Sparse phase retrieval from short-Time Fourier measurements, " IEEE Signal Process. Lett., vol. 22, no. 5, pp. 638-642, May 2015.
126. I. Waldspurger, A. dAspremont, and S. Mallat, "Phase recovery, MaxCut, and complex semidefinite programming, " Math. Program. A, vol. 149, no. 1, pp. 47-81, 2015.
127. J. Fienup, "Phase retrieval algorithms: A comparison, " Appl. Opt., vol. 21, pp. 2758-2769, 1982.
128. P. Netrapalli, P. Jain, and S. Sanghavi, "Phase retrieval using alternating minimization, " in Proc. Adv. Neural Process. Syst. (NIPS), Lake Tahoe, NV, USA, Dec. 2013, pp. 2796-2804.
129. E. Candès, X. Li, and M. Soltanolkotabi, "Phase retrieval via Wirtinger flow: Theory and algorithms, " IEEE Trans. Inform. Theory, vol. 61, no. 4, pp. 1985-2007, Apr. 2015.
130. C. White, S. Sanghavi, and R. Ward, "The local convexity of solving systems of quadratic equations, " arxiv:1506.07868, 2015.
131. Y. Shechtman, Y. Eldar, O. Cohen, H. Chapman, J. Miao, and M. Segev, "Phase retrieval with applications to optical imaging, " IEEE Signal Process. Mag., vol. 32, no. 3, pp. 87-109, May 2015.
132. S. Choudhary and U. Mitra, "Fundamental limits of blind deconvolution-Part I: Ambiguity kernel, " arxiv:1411.3810, 2014.
133. A. Ahmed, B. Recht, and J. Romberg, "Blind deconvolution using convex programming, " IEEE Trans. Inf. Theory, vol. 60, no. 3, pp. 1711-1732, Mar. 2014.
134. Y. Li, K. Lee, and Y. Bresler, "Identifiability in blind deconvolution with subspace or sparsity constraints, " arxiv:1505.03399, 2015.
135. S. Haykin, Ed., Blind Deconvolution. Englewood Cliffs, NJ, USA: Prentice-Hall, 1994.
136. P. Campisi and K. Egiazarian, Eds., Blind Image Deconvolution. Boca Raton, FL, USA: CRC Press, 2007.
137. L. Tong and S. Perreau, "Multichannel blind identification: From subspace to maximum likelihood methods, " Proc. IEEE, vol. 86, no. 10, pp. 1951-1968, Oct. 1998.
138. S. Ling and T. Strohmer, "Self-calibration and biconvex compressive sensing, " arxiv:1501.06864, 2015.
139. K. Lee, Y. Li, M. Junge, and Y. Bressler, "Stability in blind deconvolution of sparse signals and reconstruction by alternating minimization, " in Proc. Sampling Theory Appl. (SampTA), Washington, DC, USA, May 2015, pp. 158-162.
140. Y. Chi, "Guaranteed blind sparse spikes deconvolution via lifting and convex optimization, " IEEE J. Sel. Topics Signal Process, 2016, doi: 10.1109/JSTSP.2016.2543462.
141. S. Bahmani and J. Romberg, "Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements, " arXiv:1506.08159, 2016.