Abstract
In this paper, we combine the golden ratio method with the projection algorithm to obtain the golden ratio projection algorithm. In order to get better convergence speed, we also propose an alternating golden ratio projection algorithm. Unlike ordinary inertial extrapolation, golden ratio method is constructed based on a convex combined structure about the entire iterative trajectory. The advantages of the proposed algorithms require only one projection onto the feasible set and do not require knowledge of the Lipschitz constant for the operator since our algorithms use self-adaptive step-sizes. The R-linear convergence results of the two algorithms are established for strongly pseudo-monotone variational inequality. Finally, we present some numerical experiments to show the efficiency and advantages of the proposed 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.
