Sparse Regularization via Convex Analysis
From MaRDI portal
Publication:4621829
DOI10.1109/TSP.2017.2711501zbMath1414.94545arXiv1803.06765OpenAlexW2620850570MaRDI QIDQ4621829
Publication date: 8 February 2019
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.06765
Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (22)
Sparse solutions to an underdetermined system of linear equations via penalized Huber loss ⋮ Minimizers of sparsity regularized Huber loss function ⋮ Penalized least square in sparse setting with convex penalty and non Gaussian errors ⋮ A solution approach for cardinality minimization problem based on fractional programming ⋮ Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion ⋮ Sparse reconstruction via the mixture optimization model with iterative support estimate ⋮ Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm ⋮ Sparse and robust estimation with ridge minimax concave penalty ⋮ A convex-Nonconvex strategy for grouped variable selection ⋮ Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing ⋮ Diffusion optical tomography reconstruction based on convex–nonconvex graph total variation regularization ⋮ A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing ⋮ Alternating direction method of multipliers for nonconvex log total variation image restoration ⋮ A characterization of proximity operators ⋮ New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem ⋮ Non-convex total variation regularization for convex denoising of signals ⋮ An unbiased approach to compressed sensing ⋮ Non-convex Optimization via Strongly Convex Majorization-minimization ⋮ A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem ⋮ Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition ⋮ Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines ⋮ Low-CP-rank tensor completion via practical regularization
This page was built for publication: Sparse Regularization via Convex Analysis
