Abstract
ABSTRACT In this paper, we introduce a new inertial self-adaptive parallel subgradient extragradient method for finding common solution of variational inequality problems with monotone and Lipschitz continuous operators. The stepsize of the algorithm is updated self-adaptively at each iteration and does not involve a line search technique nor a prior estimate of the Lipschitz constants of the cost operators. Also, the algorithm does not required finding the farthest element of the finite sequences from the current iterate which has been used in many previous methods. We prove a strong convergence result and provide some applications of our result to other optimization problems. We also give some numerical experiments to illustrate the performance of the algorithm by comparing with some other related methods in the literature.
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.
