A bisection method for computing the proximal operator of the _p-norm for any 0 < p < 1 with application to Schatten p-norms
From MaRDI portal
Publication:6567316
Recommendations
- Proximal algorithm for minimization problems in \(l_0\)-regularization for nonlinear inverse problems
- The proximity operator of the log-sum penalty
- Iterative thresholding algorithm based on non-convex method for modified l_p-norm regularization minimization
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
- Fast L1-L2 minimization via a proximal operator
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A General-Thresholding Solution for lp(0 <; p <; 1) Regularized CT Reconstruction
- A Singular Value Thresholding Algorithm for Matrix Completion
- CRC standard mathematical tables and formulas
- High-Dimensional Data Analysis with Low-Dimensional Models
- scientific article; zbMATH DE number 823379 (Why is no real title available?)
- Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
- Iterative thresholding for sparse approximations
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(2)
This page was built for publication: A bisection method for computing the proximal operator of the \(\ell_p\)-norm for any \(0 < p < 1\) with application to Schatten \(p\)-norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567316)