Minimization of transformed \(l_1\) penalty: closed form representation and iterative thresholding algorithms
From MaRDI portal
Publication:2627199
DOI10.4310/CMS.2017.v15.n2.a9zbMath1386.94048arXiv1412.5240OpenAlexW2964088520MaRDI QIDQ2627199
Publication date: 30 May 2017
Published in: Communications in Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5240
compressed sensingrobust recoverytransformed \(l_1\) penaltyclosed form thresholding functionsiterative thresholding algorithms
Related Items (15)
A General Framework of Rotational Sparse Approximation in Uncertainty Quantification ⋮ Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee ⋮ Minimizing L 1 over L 2 norms on the gradient ⋮ The springback penalty for robust signal recovery ⋮ A novel regularization based on the error function for sparse recovery ⋮ Stable Image Reconstruction Using Transformed Total Variation Minimization ⋮ Transformed \(\ell_1\) regularization for learning sparse deep neural networks ⋮ Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum ⋮ A primal dual active set with continuation algorithm for high-dimensional nonconvex SICA-penalized regression ⋮ \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery ⋮ Enhanced total variation minimization for stable image reconstruction ⋮ Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing ⋮ A Scale-Invariant Approach for Sparse Signal Recovery ⋮ Point spread function engineering for 3D imaging of space debris using a continuous exact \(\ell_0\) penalty (CEL0) based algorithm ⋮ Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization
This page was built for publication: Minimization of transformed \(l_1\) penalty: closed form representation and iterative thresholding algorithms
