We first introduce the weighted averaged projection sequence in $\text{CAT}(\unicode[STIX]{x1D705})$ spaces and then we establish some inequalities for the weighted averaged projection sequence. Using the inequalities, we prove the asymptotic regularity and the $\unicode[STIX]{x1D6E5}$-convergence of the weighted averaged projection sequence. Furthermore, we prove the strong convergence of the sequence under certain regularity or compactness conditions on $\text{CAT}(\unicode[STIX]{x1D705})$ spaces.

We study the convex feasibility problem in $\text{CAT}(\unicode[STIX]{x1D705})$ spaces using Mann’s iterative projection method. To do this, we extend Mann’s projection method in normed spaces to $\text{CAT}(\unicode[STIX]{x1D705})$ spaces with $\unicode[STIX]{x1D705}\geq 0$, and then we prove the $\unicode[STIX]{x1D6E5}$-convergence of the method. Furthermore, under certain regularity or compactness conditions on the convex closed sets, we prove the strong convergence of Mann’s alternating projection sequence in $\text{CAT}(\unicode[STIX]{x1D705})$ spaces with $\unicode[STIX]{x1D705}\geq 0$.

In this paper, we generalize monotone operators, their resolvents and the proximal point algorithm to complete CAT(0) spaces. We study some properties of monotone operators and their resolvents. We show that the sequence generated by the inexact proximal point algorithm $\unicode[STIX]{x1D6E5}$-converges to a zero of the monotone operator in complete CAT(0) spaces. A strong convergence (convergence in metric) result is also presented. Finally, we consider two important special cases of monotone operators and we prove that they satisfy the range condition (see Section 4 for the definition), which guarantees the existence of the sequence generated by the proximal point algorithm.