S-iterative algorithm for solving variational inequalities

被引:4
|
作者
Erturk, Muzeyyen [1 ]
Gursoy, Faik [1 ]
Simsek, Necip [2 ]
机构
[1] Adiyaman Univ, Dept Math, TR-02040 Adiyaman, Turkey
[2] Istanbul Commerce Univ, Dept Math, Istanbul, Turkey
关键词
S-iterative algorithm; convergence; rate of convergence; variational inequality; nonexpansive mappings; convex optimization; NONEXPANSIVE-MAPPINGS; FIXED-POINTS;
D O I
10.1080/00207160.2020.1755430
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页码:435 / 448
页数:14
相关论文
共 50 条