Pages that link to "Item:Q5242863"
From MaRDI portal
The following pages link to Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing (Q5242863):
Displaying 14 items.
- Painless breakups -- efficient demixing of low rank matrices (Q1710648) (← links)
- A convex variational model for learning convolutional image atoms from incomplete data (Q1988356) (← links)
- Sparse power factorization: balancing peakiness and sample complexity (Q2000543) (← links)
- Estimation from nonlinear observations via convex programming with application to bilinear regression (Q2002578) (← links)
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
- Regularized fast multiple-image deconvolution for LBT (Q2508952) (← links)
- Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements (Q2662546) (← links)
- Learning Iteration-wise Generalized Shrinkage-Thresholding Operators for Blind Deconvolution (Q4616352) (← links)
- The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem (Q5000576) (← links)
- Manifold Gradient Descent Solves Multi-Channel Sparse Blind Deconvolution Provably and Efficiently (Q5001827) (← links)
- Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent (Q5143310) (← links)
- The numerics of phase retrieval (Q5887821) (← links)
- Riemannian thresholding methods for row-sparse and low-rank matrix recovery (Q6157448) (← links)
- Performance bounds of the intensity-based estimators for noisy phase retrieval (Q6185682) (← links)
