Abstract
In this article, we introduce $G$-subgradient extragradient method for solving the $G$- variational inequality problem in Hilbert space endowed with a direct graph. Utilizing our mathematical tools, weak and strong convergence theorem are established for the proposed algorithm. In addition, we provide numerical experiments to illustrate the convergence behavior of our proposed algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
