Abstract
We study two projection algorithms for solving the variational inequality problem in Hilbert space. One algorithm is a modified subgradient extragradient method in which an additional projection onto the intersection of two half-spaces is employed. Another algorithm is based on the shrinking projection method. We establish strong convergence theorems for both algorithms.
Sign-in/Register to access full text options 
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.
