Rapid, robust, and reliable blind deconvolution via nonconvex optimization
From MaRDI portal
Publication:2330939
DOI10.1016/j.acha.2018.01.001zbMath1422.94013arXiv1606.04933OpenAlexW2963731874MaRDI QIDQ2330939
Publication date: 23 October 2019
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.04933
Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (31)
The numerics of phase retrieval ⋮ Understanding generalization error of SGD in nonconvex optimization ⋮ Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA ⋮ $L_1$-Norm Regularization for Short-and-Sparse Blind Deconvolution: Point Source Separability and Region Selection ⋮ Inference for low-rank tensors -- no need to debias ⋮ Asymmetry helps: eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices ⋮ Admissible measurements and robust algorithms for ptychography ⋮ Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements ⋮ Image completion and blind deconvolution: model and algorithm ⋮ Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution ⋮ Fundamental limits of weak recovery with applications to phase retrieval ⋮ Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs ⋮ Blind three dimensional deconvolution via convex optimization ⋮ A Generalization of Wirtinger Flow for Exact Interferometric Inversion ⋮ Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval ⋮ Riemannian thresholding methods for row-sparse and low-rank matrix recovery ⋮ Two relaxation methods for rank minimization problems ⋮ Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation ⋮ Reconstruction Methods in THz Single-Pixel Imaging ⋮ Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent ⋮ Sparse power factorization: balancing peakiness and sample complexity ⋮ Estimation from nonlinear observations via convex programming with application to bilinear regression ⋮ Multi-target detection with application to cryo-electron microscopy ⋮ Sensor calibration for off-the-grid spectral estimation ⋮ Hyperbolic Wavelet Frames and Multiresolution in the Weighted Bergman Spaces ⋮ Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness ⋮ Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence ⋮ Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold ⋮ A scalable estimator of sets of integral operators ⋮ Unnamed Item ⋮ Multilinear Compressive Sensing and an Application to Convolutional Linear Networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Von Neumann entropy penalization and low-rank matrix estimation
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Four short stories about Toeplitz matrix calculations
- Weak convergence and empirical processes. With applications to statistics
- Exact matrix completion via convex optimization
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- Blind Deconvolution Using Convex Programming
- Self-calibration and biconvex compressive sensing
- Phase Retrieval Using Alternating Minimization
- Blind channel identification based on second-order statistics: a frequency-domain approach
- Matrix Completion From a Few Entries
- Fundamentals of Wireless Communication
- Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
- A Simpler Approach to Matrix Completion
- Blind Image Deconvolution
- Blind Image Deconvolution
This page was built for publication: Rapid, robust, and reliable blind deconvolution via nonconvex optimization
