On the convex geometry of blind deconvolution and matrix completion
From MaRDI portal
Recommendations
- Proof methods for robust low-rank matrix recovery
- Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
- Exact matrix completion via convex optimization
- Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
- On the robustness of noise-blind low-rank recovery from rank-one measurements
Cited in
(11)- Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
- Proof methods for robust low-rank matrix recovery
- On the robustness of noise-blind low-rank recovery from rank-one measurements
- Lifting for blind deconvolution in random mask imaging: identifiability and convex relaxation
- WARPd: a linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions
- Composite optimization for robust rank one bilinear sensing
- Riemannian thresholding methods for row-sparse and low-rank matrix recovery
- On the convex geometry of blind deconvolution and matrix completion
- Robust Matrix Completion with Heavy-Tailed Noise
- How robust is randomized blind deconvolution via nuclear norm minimization against adversarial noise?
- Recovery performance of PhaseLift for phase retrieval from coded diffraction patterns
This page was built for publication: On the convex geometry of blind deconvolution and matrix completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4995555)
