Fetching the paper…
Reading the bibliography…
We study the question of reconstructing two signals $f$ and $g$ from their convolution $y = f\ast g$.
Perturbation theory for the singular value decomposition
G. W. Stewart · 1990
Earlier work this paper cites.
Restoration of astronomical images by iterative blind deconvolution
S. M. Jefferies and J. C. Christou · 1993
Earlier work this paper cites.
Blind identification and equalization based on second-order statistics: A frequency domain approach
L. Tong, G. Xu, B. Hassibi, and T. Kailath · 1995
Earlier work this paper cites.
Weak convergence and empirical processes
A. van der Vaart and J. Wellner · 1996
Earlier work this paper cites.
Total variation blind deconvolution
T. F. Chan and C.-K. Wong · 1998
Earlier work this paper cites.
Blind equalization and multiuser detection in dispersive cdma channels
X. Wang and H. V. Poor · 1998
Earlier work this paper cites.
em Nonlinear programming
D. P. Bertsekas · 1999
Earlier work this paper cites.
Four short stories about Toeplitz matrix calculations
T. Strohmer · 2002
Earlier work this paper cites.
Fundamentals of Wireless Communication
D. Tse and P. Viswanath · 2005
Earlier work this paper cites.
Blind image deconvolution: theory and applications
P. Campisi and K. Egiazarian · 2007
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. Candès and B. Recht · 2009
Earlier work this paper cites.
Matrix completion from noisy entries
R. Keshavan, A. Montanari, and S. Oh · 2009
Earlier work this paper cites.
Matrix completion from a few entries
R. H. Keshavan, A. Montanari, and S. Oh · 2010
Earlier work this paper cites.
Practical large-scale optimization for max-norm regularization
J. D. Lee, B. Recht, N. Srebro, J. Tropp, and R. R. Salakhutdinov · 2010
Earlier work this paper cites.
Alternating projection methods
R. Escalante and M. Raydan · 2011
Earlier work this paper cites.
Von Neumann entropy penalization and low-rank matrix estimation
V. Koltchinskii et al · 2011
Cited alongside, same era.
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
V. Koltchinskii, K. Lounici, A. B. Tsybakov, et al · 2011
Cited alongside, same era.
Understanding blind deconvolution algorithms
A. Levin, Y. Weiss, F. Durand, and W. Freeman · 2011
Cited alongside, same era.
A simpler approach to matrix completion
B. Recht · 2011
Cited alongside, same era.
Introduction to the non-asymptotic analysis of random matrices
R. Vershynin · 2012
Cited alongside, same era.
Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming
E. J. Candès, T. Strohmer, and V. Voroninski · 2013
Cited alongside, same era.
Y. Li, K. Lee, and Y. Bresler · 2015
Later among the works it cites.
Blind deconvolution meets blind demixing: Algorithms and performance bounds
S. Ling and T. Strohmer · 2015
Later among the works it cites.
Self-calibration and biconvex compressive sensing
S. Ling and T. Strohmer · 2015
Later among the works it cites.
Matrix Completion via Nonconvex Factorization: Algorithms and Theory
R. Sun · 2015
Later among the works it cites.
Guaranteed matrix completion via nonconvex factorization
R. Sun and Z.-Q. Luo · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Blind deconvolution using convex programming
A. Ahmed, B. Recht, and J. Romberg · 2014
Cited alongside, same era.
Blind Image Deconvolution: Methods and Convergence
S. Chaudhuri, R. Velmurugan, and R. Rameshan · 2014
Cited alongside, same era.
Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow
T. T. Cai, X. Li, and Z. Ma · 2015
Cited alongside, same era.
Phase retrieval via Wirtinger flow: Theory and algorithms
E. J. Candès, X. Li, and M. Soltanolkotabi · 2015
Cited alongside, same era.
Solving random quadratic systems of equations is nearly as easy as solving linear systems
Y. Chen and E. Candes · 2015
Cited alongside, same era.
Y. Chen and M. J. Wainwright · 2015
Cited alongside, same era.
S. Tu, R. Boczar, M. Soltanolkotabi, and B. Recht · 2015
Later among the works it cites.
Guarantees of riemannian optimization for low rank matrix recovery
K. Wei, J.-F. Cai, T. F. Chan, and S. Leung · 2015
Later among the works it cites.
Sparse signal processing concepts for efficient 5G system design
G. Wunder, H. Boche, T. Strohmer, and P. Jung · 2015
Later among the works it cites.
A non-convex blind calibration method for randomised sensing strategies
V. Cambareri and L. Jacques · 2016
Closest in time.
M. Kech and F. Krahmer · 2016
Closest in time.
Gradient descent converges to minimizers
J. D. Lee, M. Simchowitz, M. I. Jordan, and B. Recht · 2016
Closest in time.
When Are Nonconvex Optimization Problems Not Scary?
J. Sun · 2016
Closest in time.
A geometric analysis of phase retrieval
J. Sun, Q. Qu, and J. Wright · 2016
Closest in time.
Q. Zheng and J. Lafferty · 2016
Closest in time.