The Proximity Operator of the Log-Sum Penalty
The Proximity Operator of the Log-Sum Penalty
复制标题
DOI:
10.1007/s10915-022-02021-4
复制
发表时间:
2022-12-01
影响因子:
2.5
通讯作者:
Tripp,Erin E.
中科院分区:
文献类型:
--
作者:
Prater-Bennette,Ashley;Shen,Lixin;Tripp,Erin E.
The log-sum penalty is often adopted as a replacement for thepseudo-norm in compressive sensing and low-rank optimization. The proximity operator of thepenalty, i.e., the hard-thresholding operator, plays an essential role in applications; similarly, we require an efficient method for evaluating the proximity operator of the log-sum penalty. Due to the nonconvexity of this function, its proximity operator is commonly computed through the iteratively reweightedmethod, which replaces the log-sum term with its first-order approximation. This paper reports that the proximity operator of the log-sum penalty actually has an explicit expression. With it, we show that the iteratively reweightedsolution disagrees with the true proximity operator in certain regions. As a by-product, the iteratively reweightedsolution is precisely characterized in terms of the chosen initialization. We also give the explicit form of the proximity operator for the composition of the log-sum penalty with the singular value function, as seen in low-rank applications. These results should be useful in the development of efficient and accurate algorithms for optimization problems involving the log-sum penalty. We present applications to solving compressive sensing problems and to mixed additive Gaussian white noise and impulse noise removal.