Abstract

In this paper, a new spectral gradient direction is proposed to solve the l1 -regularized convex minimization problem. The spectral parameter of the proposed method is computed as a convex combination of two existing spectral parameters of some conjugate gradient method. Moreover, the spectral gradient method is applied to the resulting problem at each iteration without requiring the Jacobian matrix. Furthermore, the proposed method is shown to have converge globally under some assumptions. Numerically, the proposed method is efficient and robust in terms of its quality in reconstructing sparse signal and low computational cost compared to the existing methods.

This work is licensed under a Creative Commons Attribution 4.0 License.