Enhanced Sparsity by Non-Separable Regularization

Abstract

This paper develops a convex approach for sparse one-dimensional deconvolution that improves upon L1-norm regularization, the standard convex approach. We propose a sparsity-inducing non-separable non-convex bivariate penalty function for this purpose. It is designed to enable the convex formulation of ill-conditioned linear inverse problems with quadratic data fidelity terms. The new penalty overcomes limitations of separable regularization. We show how the penalty parameters should be set to ensure that the objective function is convex, and provide an explicit condition to verify the optimality of a prospective solution. We present an algorithm (an instance of forward-backward splitting) for sparse deconvolution using the new penalty.

38 pages

References in corpus (4)

• A fast approach for overcomplete sparse decomposition based on smoothed L0 norm
• One-step sparse estimates in nonconcave penalized likelihood models
• Euclid in a Taxicab: Sparse Blind Deconvolution with Smoothed l1/l2 Regularization
• On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty

Cited by in corpus (6)

• Sparse Regularization via Convex Analysis
• Total Variation Denoising via the Moreau Envelope
• A Penalty Function Promoting Sparsity Within and Across Groups
• Linearly-involved Moreau-Enhanced-over-Subspace Model: Debiased Sparse Modeling and Stable Outlier-Robust Regression
• Basis Pursuit Denoise with Nonsmooth Constraints
• Monotone Lipschitz-Gradient Denoiser: Explainability of Operator Regularization Approaches Free From Lipschitz Constant Control