Abstract
In this work, we present a refined convergence analysis of the Popov's projection algorithm for solving pseudo-monotone variational inequalities in Hilbert spaces. Our analysis results in a larger range of stepsize, which is achieved by using a new Lyapunov function. Furthermore, when the operator is strongly pseudo-monotone and Lipschitz continuous, we establish the linear convergence of the sequence generated by the Popov's algorithm. As a by-product of our analysis, we extend the range of stepsize in the projected reflected gradient algorithm for solving unconstrained pseudo-monotone variational inequalities.
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.
