A Krasnoselskii-Type Algorithm For Approximating Solutions Of Variational Inequality Problems And Convex Feasibility Problems

ABSTRACT

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. Some applications of the theorem are presented.

Overall Rating

0

5 Star
(0)
4 Star
(0)
3 Star
(0)
2 Star
(0)
1 Star
(0)
APA

Abubakar, A (2021). A Krasnoselskii-Type Algorithm For Approximating Solutions Of Variational Inequality Problems And Convex Feasibility Problems. Afribary. Retrieved from https://track.afribary.com/works/a-krasnoselskii-type-algorithm-for-approximating-solutions-of-variational-inequality-problems-and-convex-feasibility-problems

MLA 8th

Abubakar, Adamu "A Krasnoselskii-Type Algorithm For Approximating Solutions Of Variational Inequality Problems And Convex Feasibility Problems" Afribary. Afribary, 07 Apr. 2021, https://track.afribary.com/works/a-krasnoselskii-type-algorithm-for-approximating-solutions-of-variational-inequality-problems-and-convex-feasibility-problems. Accessed 23 Nov. 2024.

MLA7

Abubakar, Adamu . "A Krasnoselskii-Type Algorithm For Approximating Solutions Of Variational Inequality Problems And Convex Feasibility Problems". Afribary, Afribary, 07 Apr. 2021. Web. 23 Nov. 2024. < https://track.afribary.com/works/a-krasnoselskii-type-algorithm-for-approximating-solutions-of-variational-inequality-problems-and-convex-feasibility-problems >.

Chicago

Abubakar, Adamu . "A Krasnoselskii-Type Algorithm For Approximating Solutions Of Variational Inequality Problems And Convex Feasibility Problems" Afribary (2021). Accessed November 23, 2024. https://track.afribary.com/works/a-krasnoselskii-type-algorithm-for-approximating-solutions-of-variational-inequality-problems-and-convex-feasibility-problems