In this paper, we propose to use spectral proximal method solve sparse optimization problems. Sparse refers an problem involving the ι 0 -norm in objective or constraints. The previous research showed that gradient is outperformed other standard unconstrained methods. This due replaced full rank matrix by a diagonal and memory decreased from Ο(n 2 ) Ο(n). Since term nonconvex non-smooth, it can...