Sparse Signal Estimation by Maximally Sparse Convex Optimization

DOI10.1109/TSP.2014.2298839zbMath1394.94510arXiv1302.5729OpenAlexW2122950831MaRDI QIDQ4579027

Ivan W. Selesnick, ịlker Bayram

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (17)

A survey on some recent developments of alternating direction method of multipliers ⋮ Convex image denoising via non-convex regularization with parameter selection ⋮ Convex non-convex image segmentation ⋮ A nonconvex approach to low-rank matrix completion using convex optimization ⋮ A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems ⋮ Sparsity-Assisted Signal Smoothing ⋮ Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing ⋮ Non-convex total variation regularization for convex denoising of signals ⋮ Matrix completion for matrices with low-rank displacement ⋮ Convex Image Denoising via Non-Convex Regularization ⋮ \(p\)-Laplace diffusion for distance function estimation, optimal transport approximation, and image enhancement ⋮ Iterative adaptive nonconvex low-rank tensor approximation to image restoration based on ADMM ⋮ Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization ⋮ A convex-nonconvex variational method for the additive decomposition of functions on surfaces ⋮ Convergence rates for oversmoothing Banach space regularization ⋮ A Variational Approach to Additive Image Decomposition into Structure, Harmonic, and Oscillatory Components ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming

This page was built for publication: Sparse Signal Estimation by Maximally Sparse Convex Optimization