Abstract

In this paper, we propose two classes of the approximations to the cardinality function via the Moreau envelope of the \begin{document}$ \ell_{1} $\end{document} norm. We show that these two approximations are good choices of the merit function for sparsity and are essentially the truncated \begin{document}$ \ell_{1} $\end{document} norm and the truncated \begin{document}$ \ell_{2} $\end{document} norm. Moreover, we apply the approximations to solve sparse signal recovery problems and then provide new weights for reweighted \begin{document}$ \ell_{1} $\end{document} minimization and reweighted least squares to find sparse solutions of underdetermined linear systems of equations. Finally, we present some numerical experiments to illustrate our results.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call