Weak and strong convergence results for solving monotone variational inequalities in reflexive Banach spaces

References

• Korpelevich GM. The extragradient method for finding saddle points and other problem. Ekonomika i Matematicheskie Metody. 1976;12:747–756.
   Google Scholar
• Antipin AS. On a method for convex programs using a symmetrical modification of the Lagrange function. Ekonomika i Matematicheskie Metody. 1976;12(6):1164–1173.
   Google Scholar
• Tseng P. A modified forward-backward splitting method for maximal monotone mapping. SIAM J Control Optim. 2000;38:431–446.
   Web of Science ®Google Scholar
• Anh PK, Thong DV, Vinh NT. Improved inertial extragradient methods for solving pseudo-monotone variational inequalities. Optimization. 2020;71:505–528. https://doi.org/10.1080/02331934.2020.1808644.
   Web of Science ®Google Scholar
• Chen J, Liu S, Chang X. Modified Tseng's extragradient methods for variational inequality on Hadamard manifolds. Appl Anal. 2019;100:2627–2640. https://doi.org/10.1080/00036811.2019.1695783.
   Web of Science ®Google Scholar
• Hammad HA, Rehman H, la Sen MD. Shrinking projection methods for accelerating relaxed inertial tseng-type algorithm with applications. Math Probl Eng. 2020;2020:7487–383.
   Web of Science ®Google Scholar
• Liu HW, Yang J. Weak convergence of iterative methods for solving quasimonotone variational inequalities. Comput Optim Appl. 2020;77:491–508.
   Web of Science ®Google Scholar
• Thong DV, Hieu DV. Weak and strong convergence throrems for variational inequality problems. Numer Algor. 2018;78(4):1045–1060.
   Web of Science ®Google Scholar
• Thong DV, Vinh NT, Hieu DV. Accelerated hybrid and shrinking projection methods for variational inequality problems. Optimization. 2019;68(5):981–998.
   Web of Science ®Google Scholar
• Thong DV, Yang J, Cho YJ, et al. Explicit extragradient-likemethod with adaptive stepsizes for pseudomonotone variational inequalities. Optim Lett. 2021;15:2181–2199.
   Web of Science ®Google Scholar
• Yang J, Liu H. Strong convergence result for solving monotone variational inequalities in Hilbert space. Numer Algorithms. 2019;80(3):741–752.
   Web of Science ®Google Scholar
• Shehu Y. Single projection algorithm for variational inequalities in Banach spaces with application to contact problem. Acta Math Sci. 2020;40:1045–1063.
   Web of Science ®Google Scholar
• Rockafellar RT. Convex analysis. Princeton: Princeton University Press; 1970.
   Google Scholar
• Beck A. First-order methods in optimization. Philadelphia: Society for Industrial and Applied Mathematics; 2017.
   Google Scholar
• Barbu V, Precupanu T. Convexity and optimization in Banach spaces. London New York: Springer Dordrecht Heidelberg; 2010.
   Google Scholar
• Pathak HK. An introduction to nonlinear analysis and fixed point theory. Springer Nature Singapore Pte Ltd. 2018.
   Google Scholar
• Reich S, Sabach S. A strong convergence theorem for a proximal-type algorithm in reflexive Banach spaces. J Nonlinear Convex Anal. 2009;1:471–485.
   Google Scholar
• Zălinescu C. Convex analysis in general vector spaces. River Edge: World Scientific, Publishing Co. Inc.; 2002.
   Google Scholar
• Reich S, Sabach S. Two strong convergence theorems for a proximal method in reflexive Banach spaces. Numerical Funct Anal Optim. 2010;31(1):2–44.
   Web of Science ®Google Scholar
• Bonnans JF, Shapiro A. Perturbation analysis of optimization problems. New York: Springer Verlag; 2000.
   Google Scholar
• Bauschke HH, Borwein JM, Combettes PL. Essential smoothness, essential strict convexity, and Legendre functions in Banach spaces. Commun Contemp Math. 2001;3:615–647.
   Web of Science ®Google Scholar
• Reich S, Sabach S. Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces. Nonlinear Anal. TMA. 2010;73:122–135.
   Web of Science ®Google Scholar
• Bauschke HH, Borwein JM. Legendre functions and the method of random Bregman projections. J Convex Anal. 1997;4:27–67.
   Google Scholar
• Bauschke HH, Wang X, Ye J, et al. Bregman distances and Chebyshev sets. J Approximation Theory. 2009;159:3–25.
   Web of Science ®Google Scholar
• Bregman LM. The relaxation method for finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput Math Math Phys. 1967;7:200–217.
   Google Scholar
• Alber YI. Metric and generalized projection operators in Banach spaces: properties and applications. In: A.G. Kartsatos editiors. Theory and applications of nonlinear operator of accretive and monotone type. New York: Marcel Dekker; 1996. p. 15–50.
   Google Scholar
• Reich S. A weak convergence theorem for the alternating method with Bregman distances. In: Theory and applications of nonlinear operators of accretive and monotone type. New York: Marcel Dekker; 1996. p. 313–318.
   Google Scholar
• Nakajo K. Strong convergence for gradient projection method and relatively nonexpansive mappings in Banach spaces. Appl Math Comput. 2015;271:251–258.
   Web of Science ®Google Scholar
• Butnariu D, Resmerita E. Bregman distances, totally convex functions and a method for solving operator equations in Banach spaces. Abstr Appl Anal. 2006;2006:84919.
   Google Scholar
• Alber YI. Generalized projection operators in Banach spaces: properties and applications. In: Proceedings of the Israel Seminar, Vol. 1 of Functional Differential Equation, Ariel. 1993. p. 1–21.
   Google Scholar
• Martín-Márquez V, Reich S, Sabach S. Iterative methods for approximating fixed points of Bregman nonexpansive operators. Discrete Continuous Dyn Syst Ser S. 2013;6(4):1043–1063.
   Web of Science ®Google Scholar
• Butnariu D, Iusem AN. Totally convex functions for fixed points computation and infinite dimensional optimization. Dordrecht: Kluwer Academic Publishers; 2000.
   Google Scholar
• Rockafellar RT. On the maximality of sums of nonlinear monotone operators. Trans Amer Math Soc. 1970;149:75–88.
   Web of Science ®Google Scholar
• Iiduka H, Takahashi W. Weak convergence of a projection algorithm for variational inequalities in a Banach space. J Math Anal Appl. 2008;339:668–679.
   Web of Science ®Google Scholar
• Takahashi W. Nonlinear functional analysis. Yokohama: Yokohama Publishers; 2000.
   Google Scholar
• Xu HK. Iterative algorithms for nonlinear operators. J London Math Soc. 2002;66(1):240–256.
   Web of Science ®Google Scholar
• Maingé PE. Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Anal. 2008;16:899–912.
   Google Scholar
• He S, Yang C. Solving the variational inequality problem defined on intersection of finite level sets. Abstr Appl Anal. 2013;2013:8.
   Google Scholar
• Yang J, Cholamjiak P, Sunthrayuth P. Modified Tseng's splitting algorithms for the sum of two monotone operators in Banach spaces. AIMS Math. 2021;6(5):4873–4900.
   Web of Science ®Google Scholar
• Ma F. A subgradient extragradient algorithm for solving monotone variational inequalities in Banach spaces. J Inequalities Appl.. 2020;2020:26.
   Web of Science ®Google Scholar
• Yang J. Self-adaptive inertial subgradient extragradient algorithm for solving pseudomonotone variational inequalities. Appl Anal. 2021;100(5):1067–1078.
   Web of Science ®Google Scholar
• Yang J, Liu HW, Liu ZX. Modified subgradient extragradient algorithms for solving monotone variational inequalities. Optimization. 2018;67(12):2247–2258.
   Web of Science ®Google Scholar
• Harker PT, Pang JS. A damped-Newton method for the linear complementarity problem. In: Allgower G, Georg K, editors. Computational solution of nonlinear systems of equations. Providence: AMS; 1990. p. 265–284. (Lectures in Applied Mathematics; 26).
   Google Scholar
• Malitsky YV. Projected reflected gradient methods for variational inequalities. SIAM J Optim. 2015;25(1):50–520.
   Web of Science ®Google Scholar
• Mainge PE, Gobinddass ML. Convergence of one-step projected gradient methods for variational inequalities. J Optim Theory Appl. 2016;171:146–168.
   Web of Science ®Google Scholar