We consider the split common null point problem in Hilbert space. We introduce and study a shrinking projection method for finding a solution using the resolvent of a maximal monotone operator and prove a strong convergence theorem for the algorithm.

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.

The most important open problem in monotone operator theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that the classical Rockafellar’s constraint qualification holds. In this paper, we establish the maximal monotonicity of $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}A+B$ provided that $A$ and $B$ are maximally monotone operators such that ${\rm star}({\rm dom}\ A)\cap {\rm int}\, {\rm dom}\, B\neq \varnothing $, and $A$ is of type (FPV). We show that when also ${\rm dom}\ A$ is convex, the sum operator $A+B$ is also of type (FPV). Our result generalizes and unifies several recent sum theorems.

In this paper, we construct a generalized degree theory of Browder-Petryshyn or Petryshyn type for a class of semilinear operator equations involving a Fredholm type mapping with infinite dimensional kernel.

Various properties of continuity for the class of lower semicontinuous convex functions are considered and dual characterizations are established. In particular, it is shown that the restriction of a lower semicontinuous convex function to its domain (respectively, domain of subdifferentiability) is continuous if and only if its subdifferential is strongly cyclically monotone (respectively, σ-cyclically monotone).

A generalized version of the Knaster-Kuratowski-Mazurkiewicz theorem is obtained and used to generalize Ky Fan's minimax principle. This result is applied to a variational inequality.