New coordinate descent algorithm for non-smooth losses
一种非光滑损失坐标下降算法

For non-smooth losses, this paper presented a new coordinate descent algorithm, to get the closed form solution of the single variable problem by using the sorting and searching method. It analyzed the time complexity of algorithm and gave three practical skills to improve the convergence rate. The experiments demonstrate the expected efficiency of the proposed algorithms in the regularized Hinge loss.