Modified Block Newton Algorithm for $\ell_0$- Regularized Optimization

Abstract: In this paper, we propose a globally convergent Newton type method to solve $\ell_0$ regularized sparse optimization problem. In fact, a line search strategy is applied to the Newton method to obtain global convergence. The Jacobian matrix of the original problem is a block upper triangular matrix. To reduce the computational burden, our method only requires the calculation of the block diagonal. We also introduced regularization to overcome matrix singularity. Although we only use the block-diagonal part of the Jacobian matrix, our algorithm still maintains global convergence and achieves a local quadratic convergence rate. Numerical results demonstrate the efficiency of our method.