A KRASNOSELSKII-TYPE ALGORITHM FOR APPROXIMATING SOLUTIONS OF VARIATIONAL INEQUALITY PROBLEMS AND CONVEX FEASIBILITY PROBLEMS

被引：30

作者：

Chidume, Charles E. ^{[1
]}

Adamu, Abubakar ^{[1
]}

Okereke, Lois C. ^{[1
]}

机构：

[1] African Univ Sci & Technol, Abuja, Nigeria

来源：

JOURNAL OF NONLINEAR AND VARIATIONAL ANALYSIS | 2018年 / 2卷 / 02期

关键词：

Generalized projection; Monotone map; Relatively nonepxansive map; Subgradient method; Variational inequality problem; SUBGRADIENT EXTRAGRADIENT METHOD; STRONG-CONVERGENCE; BANACH-SPACES; FIXED-POINTS; PROJECTION; MAPPINGS; THEOREMS;

D O I：

10.23952/jnva.2.2018.2.07

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, a Krasnoselskii-type algorithm for approximating a common element of the set of solutions of a variational inequality problem for a monotone, k-Lipschitz map and solutions of a convex feasibility problem involving a countable family of relatively nonexpansive maps is studied in a uniformly smooth and 2-uniformly convex real Banach space. A strong convergence theorem is proved. Finally, a numerical example is presented.

引用

页码：203 / 218

页数：16

共 30 条

[1]

Alber Y., 2006, Nonlinear Ill-Posed Problems of Monotone Type

[2]

Alber Y. I., 1996, THEORY APPL NONLINEA, V178, P15

[3]

[Anonymous], 1984, Monogr. Textbooks Pure Appl. Math.

[4]

Berinde V, 2007, LECT NOTES MATH, V1912, P1