Modified projection method for solving a system of monotone equations with convex constraints

In this paper, we propose a modified projection method for solving a system of monotone equations with convex constraints. At each iteration of the method, we first solve a system of linear equations approximately, and then perform a projection of the initial point onto the intersection set of the feasible set and two half spaces containing the current iterate to obtain the next one. The iterate sequence generated by the proposed algorithm possesses an expansive property with regard to the initial point. Under mild condition, we show that the proposed algorithm is globally convergent. Preliminary numerical experiments are also reported.