Parallel Hybrid Algorithms for a Finite Family of <i>G</i>-Nonexpansive Mappings and Its Application in a Novel Signal Recovery

This article considers a parallel monotone hybrid algorithm for a finite family of G-nonexpansive mapping in Hilbert spaces endowed with graphs and suggests iterative schemes for finding a common fixed point by the two different hybrid projection methods. Moreover, we show the computational performance of our algorithm in comparison to some methods. Strong convergence theorems are proved under suitable conditions. Finally, we give some numerical experiments of our algorithms to show the efficiency and implementation of the LASSO problems in signal recovery with different types of blurred matrices and noise