2022
DOI: 10.3390/math10122140
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 implemen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…where šœ > 0. As a result, various techniques and iterative schemes have been developed over the years to solve the LASSO problem, see the literature [44][45][46][47]. In this case, we set…”
Section: Signal Recoverymentioning
confidence: 99%
See 1 more Smart Citation
“…where šœ > 0. As a result, various techniques and iterative schemes have been developed over the years to solve the LASSO problem, see the literature [44][45][46][47]. In this case, we set…”
Section: Signal Recoverymentioning
confidence: 99%
“…It is well known that the problem () can be solved by the LASSO problem: minxāˆˆnormalā„N12falseā€–yāˆ’Axfalseā€–22+Ī¶falseā€–xfalseā€–1,$$ \underset{x\in {\mathrm{\mathbb{R}}}^N}{\min}\frac{1}{2}{\left\Vert y- Ax\right\Vert}_2^2+\zeta {\left\Vert x\right\Vert}_1, $$ where Ī¶>0$$ \zeta >0 $$. As a result, various techniques and iterative schemes have been developed over the years to solve the LASSO problem, see the literature [44ā€“47]. In this case, we set Txn=proxĪ¶gfalse(xnāˆ’Ī¶āˆ‡ffalse(xnfalse)false),$$ T{x}_n= pro{x}_{\zeta g}\left({x}_n-\zeta \nabla f\left({x}_n\right)\right), $$ where ffalse(xfalse)=12falseā€–yāˆ’Axfalseā€–22,0.1emgfalse(xfalse)=Ī¶falseā€–xfalseā€–1$$ f(x)=\frac{1}{2}{\left\Vert y- Ax\right\Vert}_2^2,g(x)=\zeta {\left\Vert x\right\Vert}_1 $$ and Ī¶āˆˆ()0,2falseā€–Afalseā€–22$$ \zeta \in \left(0,\frac{2}{{\left\Vert A\right\Vert}_2^2}\right) $$.…”
Section: Signal Recovery and Polynomiographymentioning
confidence: 99%
“…T lƗ1 with l = 50, 100. For simplicity, the proposed method (15) with M ā‰¤ 3 and the nonexpansive mapping T are chosen from T WJ , T SOR , and T GS , and f (u) = u. The results of the WJ, GS, SOR, and proposed methods are given for the following cases: These are demonstrated and discussed for solving the linear system (16).…”
Section: Linear Systemmentioning
confidence: 99%
“…where Ī» > 0. As a result, various techniques and iterative schemes have been developed over the years to solve the LASSO problem; see [15,16]. In this case, we set…”
Section: Signal Recoverymentioning
confidence: 99%
See 1 more Smart Citation