Global and local R-linear convergence of a spectral projected gradient method for convex optimization with singular solution

In this paper, we propose a spectral projected gradient method for the convex optimization problem with singular solution. By solving the equivalent equation of the gradient function, this method combines the perturbed spectral gradient direction with the projection direction to generate the next iteration point. Under some mild conditions, we establish the global convergence and the local R-linear convergence rate under the local error bound condition. Preliminary numerical tests are given to show that the proposed method works well.