EUVIMEDEUVIMED entdecken
Crossref

A resolvent computational-free algorithm for solving monotone inclusion problems with applications

Abubakar Adamu, Poom Kumam, Duangkamon Kitkuan, Petcharaporn Yodjai, Kanokwan Sitthithakerngkiet

Fixed Point Theory · 01.06.2025 · 26 (2) · 323-342

DOI: 10.24193/fpt-ro.2025.2.01 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Fixed Point Theory, online erschienen am 01.05.2025. Verfasst von Abubakar Adamu und 4 weiteren Autor:innen. Die Arbeit nennt 32 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Following Chidume (Contemp. Math. (Amer. Math. Soc.) 659, 31-41, 2016) who posed an interesting question concerning the proximal point algorithm ``Can an iteration process be developed which will not involve the computation of $\big(I+\lambda_n A\big)^{-1}x_n$ at each step of the iteration process and which will guarantee strong convergence to a solution of $0\in Au$?'', in this paper, we provide an affirmative answer to the question above concerning the forward-backward algorithm. We introduce a resolvent computational-free alternative of the forward-backward algorithm for approximating zeros of sum of two monotone operators and prove a strong convergence theorem in the setting of real Hilbert spaces. Furthermore, we use our algorithm in the restoration process of some degraded images and sparse signals. In addition, numerical illustrations of our proposed algorithm in $L_2([0,1])$ is also presented. Finally, numerical comparison of the performance of our new method with some classical methods in the literature are presented.

Zitieren

APA

Adamu, A., Kumam, P., Kitkuan, D., Yodjai, P., & Sitthithakerngkiet, K. (2025). A resolvent computational-free algorithm for solving monotone inclusion problems with applications. Fixed Point Theory, 26(2), 323-342. https://doi.org/10.24193/fpt-ro.2025.2.01

Vancouver

Adamu A, Kumam P, Kitkuan D, Yodjai P, Sitthithakerngkiet K. A resolvent computational-free algorithm for solving monotone inclusion problems with applications. Fixed Point Theory. 2025;26(2):323-342. doi:10.24193/fpt-ro.2025.2.01

BibTeX
@article{Adamu2025,
  author = {Adamu, Abubakar and Kumam, Poom and Kitkuan, Duangkamon and Yodjai, Petcharaporn and Sitthithakerngkiet, Kanokwan},
  title = {A resolvent computational-free algorithm for solving monotone inclusion problems with applications},
  journal = {Fixed Point Theory},
  year = {2025},
  volume = {26},
  number = {2},
  pages = {323--342},
  doi = {10.24193/fpt-ro.2025.2.01}
}
Kostenlos starten →