189 citations · 366 across the 11 of their papers we have counts for
4 papers · 1 filter
Sparsity Within and Across Overlapping Groups
İlker Bayram
Recently, penalties promoting signals that are sparse within and across groups have been proposed. In this letter, we propose a generalization that allows to encode more intricate…
The Douglas-Rachford Algorithm for Weakly Convex Penalties
İlker Bayram, Ivan W. Selesnick
The Douglas-Rachford algorithm is widely used in sparse signal processing for minimizing a sum of two convex functions. In this paper, we consider the case where one of the functio…
On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty
Ilker Bayram
We consider the iterative shrinkage/thresholding algorithm (ISTA) applied to a cost function composed of a data fidelity term and a penalty term. The penalty is non-convex but the…
Enhanced Sparsity by Non-Separable Regularization
Ivan W. Selesnick, Iker Bayram
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-induci…