Abstract
We consider the problem of general variational inequalities, GVI, with nonmonotone operator, in a finite dimensional space. We propose a method to solve GVI that at each iteration considers only one projection on an easy approximation of the constraint set, which is important from a practical point of view. We analyse the convergence of the algorithm under a weak cocoercivity condition, using variational metric analysis. Computational experience is reported and comparative analysis with other two algorithms is also given for the monotone case.
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.
