Proximal algorithm for solving monotone variational inclusion

Abstract

In this paper, we introduce a contraction algorithm for solving monotone variational inclusion problem. To reach this goal, our main iterative algorithm combine Dong’s projection and contraction algorithm with resolvent operator. Under suitable assumptions, we prove that the sequence generated by our main iterative algorithm converges weakly to the solution of the considered problem. Finally, we give two numerical examples to verify the feasibility of our main algorithm.