Sparse Signal Estimation by Maximally Sparse Convex Optimization
From MaRDI portal
Abstract: This paper addresses the problem of sparsity penalized least squares for applications in sparse signal processing, e.g. sparse deconvolution. This paper aims to induce sparsity more strongly than L1 norm regularization, while avoiding non-convex optimization. For this purpose, this paper describes the design and use of non-convex penalty functions (regularizers) constrained so as to ensure the convexity of the total cost function, F, to be minimized. The method is based on parametric penalty functions, the parameters of which are constrained to ensure convexity of F. It is shown that optimal parameters can be obtained by semidefinite programming (SDP). This maximally sparse convex (MSC) approach yields maximally non-convex sparsity-inducing penalty functions constrained such that the total cost function, F, is convex. It is demonstrated that iterative MSC (IMSC) can yield solutions substantially more sparse than the standard convex sparsity-inducing approach, i.e., L1 norm minimization.
Cited in
(33)- Iterative adaptive nonconvex low-rank tensor approximation to image restoration based on ADMM
- Convergence rates for oversmoothing Banach space regularization
- A survey on some recent developments of alternating direction method of multipliers
- Non-convex total variation regularization for convex denoising of signals
- Matrix completion for matrices with low-rank displacement
- Convex non-convex image segmentation
- A nonconvex approach to low-rank matrix completion using convex optimization.
- Performance Guarantees for Adaptive Estimation of Sparse Signals
- Convex image denoising via non-convex regularization
- Convex image denoising via non-convex regularization with parameter selection
- From Sparse Signals to Sparse Residuals for Robust Sensing
- Projection Matrix Optimization for Sparse Signals in Structured Noise
- Minimax Optimal Sparse Signal Recovery With Poisson Statistics
- Sparse Signal Approximation via Nonseparable Regularization
- Estimating Sparse Signals Using Integrated Wideband Dictionaries
- A variational approach to additive image decomposition into structure, harmonic, and oscillatory components
- Robust Recovery of Jointly-Sparse Signals Using Minimax Concave Loss Function
- A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems
- A convex-nonconvex variational method for the additive decomposition of functions on surfaces
- Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
- Sparsity-assisted signal smoothing
- Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing
- Efficient Convex Optimization for Non-convex Non-smooth Image Restoration
- Stable local-smooth principal component pursuit
- Convex non-convex variational models
- \(p\)-Laplace diffusion for distance function estimation, optimal transport approximation, and image enhancement
- Sparse optimization of vibration signal by ADMM
- Logarithmic function minimization to compressed sensing with application to magnetic resonance imaging
- Improved low-rank matrix approximation in multivariate case
- Self-concordant smoothing in proximal quasi-Newton algorithms for large-scale convex composite optimization
- Intensity inhomogeneity image segmentation based on tight wavelet frame and variational Bayesian inference
- On the _1-norm invariant convex k-sparse decomposition of signals
This page was built for publication: Sparse Signal Estimation by Maximally Sparse Convex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579027)
