Fetching the paper…
Reading the bibliography…
We investigate the effectiveness of convex relaxation and nonconvex optimization in solving bilinear systems of equations under two different designs (i.e.$~$a sort of random Fourier design and Gaussian design).
Restoration of astronomical images by iterative blind deconvolution
S. M. Jefferies and J. C. Christou · 1993
Earlier work this paper cites.
. 879-approximation algorithms for max cut and max 2sat
M. X. Goemans and D. P. Williamson · 1994
Earlier work this paper cites.
Blind identification and equalization based on second-order statistics: A time domain approach
L. Tong, G. Xu, and T. Kailath · 1994
Earlier work this paper cites.
Blind image deconvolution
D. Kundur and D. Hatzinakos · 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.
A note on sin θ \theta theorems for singular subspace variations
F. M. Dopico · 2000
Earlier work this paper cites.
Bridging convex and nonconvex optimization in robust pca: Noise, outliers, and missing data
Y. Chen, J. Fan, C. Ma, and Y. Yan · 2001
Earlier work this paper cites.
Partial recovery for top-k ranking: Optimality of mle and sub-optimality of spectral method
P. Chen, C. Gao, and A. Y. Zhang · 2006
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. J. 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.
Introduction to the non-asymptotic analysis of random matrices
R. Vershynin · 2010
Earlier work this paper cites.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements
E. J. Candes and Y. Plan · 2011
Earlier work this paper cites.
Robust principal component analysis?
E. J. Candès, X. Li, Y. Ma, and J. Wright · 2011
Earlier work this paper cites.
Rank-sparsity incoherence for matrix decomposition
V. Chandrasekaran, S. Sanghavi, P. A. Parrilo, and A. S. Willsky · 2011
Earlier work this paper cites.
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
V. Koltchinskii, K. Lounici, A. B. Tsybakov, et al · 2011
Earlier work this paper cites.
Blind deconvolution using convex programming
A. Ahmed, B. Recht, and J. Romberg · 2013
Earlier work this paper cites.
Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming
E. J. Candes, T. Strohmer, and V. Voroninski · 2013
Earlier work this paper cites.
Matrix computations , volume 3
G. H. Golub and C. F. Van Loan · 2013
Earlier work this paper cites.
Low-rank matrix completion using alternating minimization
P. Jain, P. Netrapalli, and S. Sanghavi · 2013
Earlier work this paper cites.
Compressed sensing off the grid
G. Tang, B. N. Bhaskar, P. Shah, and B. Recht · 2013
Earlier work this paper cites.
Robust spectral compressed sensing via structured matrix completion
Y. Chen and Y. Chi · 2014
Earlier work this paper cites.
Near-optimal joint object matching via convex relaxation
Y. Chen, L. Guibas, and Q. Huang · 2014
Earlier work this paper cites.
Proximal algorithms
N. Parikh and S. Boyd · 2014
Earlier work this paper cites.
Gespar: Efficient phase retrieval of sparse signals
Y. Shechtman, A. Beck, and Y. C. Eldar · 2014
Earlier work this paper cites.
Rop: Matrix recovery via rank-one projections
T. T. Cai, A. Zhang, et al · 2015
Cited alongside, same era.
Phase retrieval via Wirtinger flow: Theory and algorithms
E. J. Candes, X. Li, and M. Soltanolkotabi · 2015
Cited alongside, same era.
Y. Chen and M. J. Wainwright · 2015
Cited alongside, same era.
Y. Li, K. Lee, and Y. Bresler · 2015
Cited alongside, same era.
Self-calibration and biconvex compressive sensing
S. Ling and T. Strohmer · 2015
Cited alongside, same era.
On the global geometry of sphere-constrained sparse blind deconvolution
Y. Zhang, Y. Lau, H.-w. Kuo, S. Cheung, A. Pasupathy, and J. Wright · 2017
Later among the works it cites.
Nonconvex demixing from bilinear measurements
J. Dong and Y. Shi · 2018
Later among the works it cites.
On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators
N. El Karoui · 2018
Later among the works it cites.
Blind deconvolution by a steepest descent algorithm on a quotient manifold
W. Huang and P. Hand · 2018
Later among the works it cites.
Fast and guaranteed blind multichannel deconvolution under a bilinear system model
K. Lee, N. Tian, and J. Romberg · 2018
Later among the works it cites.
Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval and matrix completion
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Oymak, A. Jalali, M. Fazel, Y. C. Eldar, and B. Hassibi · 2015
Cited alongside, same era.
Phase retrieval with application to optical imaging: a contemporary overview
Y. Shechtman, Y. C. Eldar, O. Cohen, H. N. Chapman, J. Miao, and M. Segev · 2015
Cited alongside, same era.
Phase recovery, maxcut and complex semidefinite programming
I. Waldspurger, A. d’Aspremont, and S. Mallat · 2015
Cited alongside, same era.
Sparse signal processing concepts for efficient 5g system design
G. Wunder, H. Boche, T. Strohmer, and P. Jung · 2015
Cited alongside, same era.
Efficient matrix sensing using rank-1 gaussian measurements
K. Zhong, P. Jain, and I. S. Dhillon · 2015
Cited alongside, same era.
Blind image deconvolution: theory and applications
P. Campisi and K. Egiazarian · 2016
Cited alongside, same era.
Guaranteed blind sparse spikes deconvolution via lifting and convex optimization
Y. Chi · 2016
Cited alongside, same era.
C. Ma, K. Wang, Y. Chi, and Y. Chen · 2018
Later among the works it cites.
High-dimensional probability: An introduction with applications in data science , volume 47
R. Vershynin · 2018
Later among the works it cites.
Near-optimal bounds for phase synchronization
Y. Zhong and N. Boumal · 2018
Later among the works it cites.
Branchhull: Convex bilinear inversion from the entrywise product of signals with known signs
A. Aghasi, A. Ahmed, P. Hand, and B. Joshi · 2019
Later among the works it cites.
Composite optimization for robust blind deconvolution
V. Charisopoulos, D. Davis, M. Díaz, and D. Drusvyatskiy · 2019
Later among the works it cites.
Nonconvex optimization meets low-rank matrix factorization: An overview
Y. Chi, Y. M. Lu, and Y. Chen · 2019
Later among the works it cites.
Solving (most) of a set of quadratic equalities: Composite optimization for robust phase retrieval
J. C. Duchi and F. Ruan · 2019
Later among the works it cites.
Rapid, robust, and reliable blind deconvolution via nonconvex optimization
X. Li, S. Ling, T. Strohmer, and K. Wei · 2019
Later among the works it cites.
Multichannel sparse blind deconvolution on the sphere
Y. Li and Y. Bresler · 2019
Later among the works it cites.
Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing
S. Ling and T. Strohmer · 2019
Later among the works it cites.
Optimization-based amp for phase retrieval: The impact of initialization and ℓ 2 \ell_{2} regularization
J. Ma, J. Xu, and A. Maleki · 2019
Later among the works it cites.
A nonconvex approach for exact and efficient multichannel sparse blind deconvolution
Q. Qu, X. Li, and Z. Zhu · 2019
Later among the works it cites.
Consistent risk estimation in high-dimensional linear regression
J. Xu, A. Maleki, and K. R. Rad · 2019
Later among the works it cites.
Structured local optima in sparse blind deconvolution
Y. Zhang, H.-W. Kuo, and J. Wright · 2019
Later among the works it cites.
Uncertainty quantification for nonconvex tensor completion: Confidence intervals, heteroscedasticity and optimality
C. Cai, H. V. Poor, and Y. Chen · 2020
Closest in time.
Leave-one-out approach for matrix completion: Primal and dual analysis
L. Ding and Y. Chen · 2020
Closest in time.
From symmetry to geometry: Tractable nonconvex problems
Y. Zhang, Q. Qu, and J. Wright · 2020
Closest in time.
Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
V. Charisopoulos, Y. Chen, D. Davis, M. Díaz, L. Ding, and D. Drusvyatskiy · 2021
Closest in time.
Manifold gradient descent solves multi-channel sparse blind deconvolution provably and efficiently
L. Shi and Y. Chi · 2021
Closest in time.