A Hybrid Algorithm For Approximating A Common Element Of Solutions Of A Variational Inequality Problem And A Convex Feasibility Problem
Subscribe to read and download this work.
ABSTRACT
In this thesis, a hybrid extragradient-like iteration algorithm for approximating a common element of the set of solutions of a variational inequality problem for a monotone, k-Lipschitz map and common fixed points of a countable family of relatively nonexpansive maps in a uniformly smooth and 2-uniformly convex real Banach space is introduced. A strong convergence theorem for the sequence generated by this algorithm is proved. The theorem obtained is a significant improvement of the results of Ceng et al. (J. Glob. Optim. 46(2010), 635-646). Finally, some applications of the theorem are presented.
Reviews
No reviews yet.
APA
(2026). A Hybrid Algorithm For Approximating A Common Element Of Solutions Of A Variational Inequality Problem And A Convex Feasibility Problem. Afribary. Retrieved June 14, 2026, from http://library.afribary.com/works/a-hybrid-algorithm-for-approximating-a-common-element-of-solutions-of-a-variational-inequality-problem-and-a-convex-feasibility-problem
MLA
"A Hybrid Algorithm For Approximating A Common Element Of Solutions Of A Variational Inequality Problem And A Convex Feasibility Problem." Afribary, 6 Jun. 2026, http://library.afribary.com/works/a-hybrid-algorithm-for-approximating-a-common-element-of-solutions-of-a-variational-inequality-problem-and-a-convex-feasibility-problem. Accessed June 14, 2026.
Chicago
"A Hybrid Algorithm For Approximating A Common Element Of Solutions Of A Variational Inequality Problem And A Convex Feasibility Problem." Afribary (2026). Accessed June 14, 2026. http://library.afribary.com/works/a-hybrid-algorithm-for-approximating-a-common-element-of-solutions-of-a-variational-inequality-problem-and-a-convex-feasibility-problem