Pages that link to "Item:Q2989627"
From MaRDI portal
The following pages link to Blind Recovery of Sparse Signals From Subsampled Convolution (Q2989627):
Displayed 16 items.
- A geometric analysis of phase retrieval (Q1785008) (← links)
- Sparse power factorization: balancing peakiness and sample complexity (Q2000543) (← links)
- Proof methods for robust low-rank matrix recovery (Q2106469) (← links)
- Solving phase retrieval with random initial guess is nearly as good as by spectral initialization (Q2118400) (← links)
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
- Blind three dimensional deconvolution via convex optimization (Q2192919) (← links)
- Fundamental limits of weak recovery with applications to phase retrieval (Q2420637) (← links)
- Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements (Q2662546) (← links)
- Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation (Q3296183) (← links)
- Self-Calibration and Bilinear Inverse Problems via Linear Least Squares (Q4686916) (← links)
- Multi-target detection with application to cryo-electron microscopy (Q5197877) (← links)
- $$L^p$$ Continuity and Microlocal Properties for Pseudodifferential Operators (Q5230197) (← links)
- Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness (Q5230405) (← links)
- Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold (Q5236625) (← links)
- Robust sensing of low-rank matrices with non-orthogonal sparse decomposition (Q6051152) (← links)
- Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs (Q6109969) (← links)