A bisection method for computing the proximal operator of the \(\ell_p\)-norm for any \(0 < p < 1\) with application to Schatten \(p\)-norms
From MaRDI portal
Publication:6567316
DOI10.1016/j.cam.2024.115897zbMath1542.90192MaRDI QIDQ6567316
Publication date: 4 July 2024
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Iterative thresholding for sparse approximations
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- On optimal solutions of the constrained ℓ 0 regularization and its penalty problem
- A Singular Value Thresholding Algorithm for Matrix Completion
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse and Redundant Representations
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- A General-Thresholding Solution for lp(0 <; p <; 1) Regularized CT Reconstruction
- High-Dimensional Data Analysis with Low-Dimensional Models
Related Items (1)
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