A Krasnoselskii-Type Algorithm For Approximating Solutions Of Variational Inequality Problems And Convex Feasibility Problems
Subscribe to read and download this work.
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.
Reviews
No reviews yet.
APA
(2026). A Krasnoselskii-Type Algorithm For Approximating Solutions Of Variational Inequality Problems And Convex Feasibility Problems. Afribary. Retrieved June 14, 2026, from http://library.afribary.com/works/a-krasnoselskii-type-algorithm-for-approximating-solutions-of-variational-inequality-problems-and-convex-feasibility-problems
MLA
"A Krasnoselskii-Type Algorithm For Approximating Solutions Of Variational Inequality Problems And Convex Feasibility Problems." Afribary, 6 Jun. 2026, http://library.afribary.com/works/a-krasnoselskii-type-algorithm-for-approximating-solutions-of-variational-inequality-problems-and-convex-feasibility-problems. Accessed June 14, 2026.
Chicago
"A Krasnoselskii-Type Algorithm For Approximating Solutions Of Variational Inequality Problems And Convex Feasibility Problems." Afribary (2026). Accessed June 14, 2026. http://library.afribary.com/works/a-krasnoselskii-type-algorithm-for-approximating-solutions-of-variational-inequality-problems-and-convex-feasibility-problems