A projection method for zeros of multi-valued monotone mappings

First-order optimization methods have long been established as effective methods for solving large-scale unconstrained optimization problems. Over time, these methods have been extended to address the task of finding zeros of single-valued monotone maps within the framework of finite-dimensional Hilbert spaces. Notably, Abubakar et al. (Comput Appl Math 39(2):129, 2020) recently introduced a projection method that incorporates a convex combination of two distinct positive spectral coefficients to find the zeros of a single-valued monotone map. Motivated by their work, this paper generalises the Abubakar et al. technique to a more general setting of infinite-dimensional Hilbert spaces. Under mild assumptions, we establish weak convergence of the generated sequence of iterates. Furthermore, the extended method does not involve computing the resolvent of the monotone operator.