Fast singular value thresholding without singular value decomposition (Q2511250): Difference between revisions

The authors consider the singular value thresholding (SVT) problem. They propose a fast algorithm for directly computing SVT for general dense matrices without using SVDs. The algorithm is based on Newton iteration for matrix functions, and the convergence is theoretically guaranteed. Numerical experiments show that the proposed algorithm is more efficient than the SVD-based approaches.