S-iterative algorithm for solving variational inequalities

Ertürk M., Gürsoy F., ŞİMŞEK N.

International Journal of Computer Mathematics, cilt.98, sa.3, ss.435-448, 2021 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 98 Sayı: 3
  • Basım Tarihi: 2021
  • Doi Numarası: 10.1080/00207160.2020.1755430
  • Dergi Adı: International Journal of Computer Mathematics
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Aerospace Database, Applied Science & Technology Source, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.435-448
  • Anahtar Kelimeler: S-iterative algorithm, convergence, rate of convergence, variational inequality, nonexpansive mappings, convex optimization
  • İstanbul Ticaret Üniversitesi Adresli: Evet

Özet

In this paper we propose an S-iterative algorithm for finding the common element of the set of solutions of the variational inequalities and the set of fixed points of nonexpansive mappings. We study the convergence criteria of the mentioned algorithm under some mild conditions. As an application, a modified algorithm is suggested to solve convex minimization problems. Numerical examples are given to validate the theoretical findings obtained herein. Our results may be considered as an improvement, refinement and complement of the previously known results.