The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem

DOI10.1088/1361-6420/ab5aa3zbMath1468.94026arXiv1811.12000OpenAlexW2990604797MaRDI QIDQ5000576

Yann Traonmilin, Jean-François Aujol

Publication date: 14 July 2021

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.12000

zbMATH Keywords

non-convex optimizationsuper-resolutionsparse spikes

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for mathematical programming, optimization and variational techniques (65K99)

Related Items (5)

Sketched learning for image denoising ⋮ Sparse optimization on measures with over-parameterized gradient descent ⋮ Initialization of metaheuristics: comprehensive review, critical analysis, and research directions ⋮ On strong basins of attractions for non-convex sparse spike estimation: upper and lower bounds ⋮ On the linear convergence rates of exchange and continuous methods for total variation minimization

Cites Work

• Unnamed Item
• Super-resolution from noisy data
• Exact support recovery for sparse spikes deconvolution
• Hilbert space embeddings and metrics on probability measures
• Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
• Fundamental Performance Limits for Ideal Decoders in High-Dimensional Linear Inverse Problems
• Atomic Norm Denoising With Applications to Line Spectral Estimation
• Adapting to unknown noise level in sparse deconvolution
• Inexact Gradient Projection and Fast Data Driven Compressed Sensing
• Through the haze: a non-convex approach to blind gain calibration for linear random sensing models
• Sketching for large-scale learning of mixture models
• Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing
• Sparse regularization on thin grids I: the Lasso
• Sampling and Reconstructing Signals From a Union of Linear Subspaces
• Compressed Sensing Off the Grid
• Sparse spikes super-resolution on thin grids II: the continuous basis pursuit
• Phase Retrieval With Random Gaussian Sensing Vectors by Alternating Projections
• Towards a Mathematical Theory of Super‐resolution
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem