Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent
From MaRDI portal
blind deconvolutioninverse problemnonconvex geometrynonconvex optimizationnonlinear approximationRiemannian manifoldsparse recovery
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Computing methodologies for image processing (68U10) Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Recommendations
- Manifold Gradient Descent Solves Multi-Channel Sparse Blind Deconvolution Provably and Efficiently
- Simultaneous Sparse Recovery and Blind Demodulation
- Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization
- Robust Multichannel Blind Deconvolution via Fast Alternating Minimization
- Blind Recovery of Sparse Signals From Subsampled Convolution
- Multichannel Sparse Blind Deconvolution on the Sphere
- Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing
Cites work
- Blind Deconvolution Using Convex Programming
- Blind Gain and Phase Calibration via Sparse Spectral Methods
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
- Convolutional Dictionary Learning: Acceleration and Convergence
- Convolutional Phase Retrieval via Gradient Descent
- Dual principal component pursuit
- Fast and Guaranteed Blind Multichannel Deconvolution Under a Bilinear System Model
- Fast, robust and non-convex subspace recovery
- Geometry and symmetry in short-and-sparse deconvolution
- Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
- scientific article; zbMATH DE number 1254560 (Why is no real title available?)
- Identifiability in Bilinear Inverse Problems With Applications to Subspace or Sparsity-Constrained Blind Gain and Phase Calibration
- Identifiability in Blind Deconvolution With Subspace or Sparsity Constraints
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Leveraging Diversity and Sparsity in Blind Deconvolution
- Multichannel Sparse Blind Deconvolution on the Sphere
- Non-convex optimization for machine learning
- Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
- Nonconvex Robust Low-Rank Matrix Recovery
- On convergence rates of subgradient optimization methods
- Optimal injectivity conditions for bilinear inverse problems with applications to identifiability of deconvolution problems
- Phase retrieval via Wirtinger flow: theory and algorithms
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization
- Recovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit
- Robust Multichannel Blind Deconvolution via Fast Alternating Minimization
- Self-calibration and biconvex compressive sensing
- Self-calibration and bilinear inverse problems via linear least squares
- Sparse Approximate Solutions to Linear Systems
- Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness
- Subgradient methods for sharp weakly convex functions
- Tail bounds via generic chaining
- The Null Space Problem I. Complexity
- Upper and lower bounds for stochastic processes. Modern methods and classical problems
- Weak Sharp Minima in Mathematical Programming
Cited in
(10)- Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization
- From Bernoulli–Gaussian Deconvolution to Sparse Signal Restoration
- Manifold Gradient Descent Solves Multi-Channel Sparse Blind Deconvolution Provably and Efficiently
- Geometry and symmetry in short-and-sparse deconvolution
- Blind deconvolution by a steepest descent algorithm on a quotient manifold
- Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing
- Performance Bounds for Cosparse Multichannel Signal Recovery via Collaborative-TV
- Estimation of off-the grid sparse spikes with over-parametrized projected gradient descent: theory and application
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
This page was built for publication: Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5143310)
