Abstract
In this work, we analyze some convergent properties of a projection and contraction algorithm for solving a variational inequality problem, where the feasible domain is the solution set of an affine variational inequality problem. We prove that, for solving the problem where the second cost mapping is affine and not necessary for monotone properties, any iterative sequence generated by the algorithm converges to a unique solution provided that the first cost mapping is strongly monotone and Lipschitz continuous. Computational errors of the algorithm are showed. Finally, some preliminary numerical experiences and comparisons are also reported.
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.
