Generalized Forward–Backward Methods and Splitting Operators for a Sum of Maximal Monotone Operators

Abstract

Suppose each of $A_1,\dots ,A_n$ is a maximal monotone, and $\beta B$ is firmly nonexpansive with $\beta >0$. In this paper, we have two purposes: the first is finding the zeros of ${\sum }_{j=1}^n{A}_j+B$, and the second is finding the zeros of ${\sum }_{j=1}^n{A}_j$. To address the first problem, we produce fixed-point equations on the original Hilbert space as well as on the product space and find that these equations associate with crucial operators which are called generalized forward–backward splitting operators. To tackle the second problem, we point out that it can be reduced to a special instance of $n=2$ by defining new operators on the product space. Iterative schemes are given, which produce convergent sequences and these sequences ultimately lead to solutions for the last two problems.

1. Introduction

In the field of image processing and restoration, the simultaneous optimization of multiple objectives is often necessary to achieve desired results. For instance, when restoring historical paintings, balancing original brushstrokes while also removing degradation is crucial. To tackle this complex optimization problem, researchers have proposed various algorithms and techniques.

In what follows, we abstract the above issues into the following two types of problems and proceed to solve them. Let $\gamma$ and $\beta$ be two positive numbers, and let $\mathcal{H}$ be a real Hilbert space with inner product $\langle ·,·\rangle$ and associated norm $\parallel ·\parallel$. We consider two classes of minimization problems

$$\begin{array}{c}\hfill \genfrac{}{}{0pt}{}{min}{x\in \mathcal{H}}\left\{\sum _{i=1}^n{f}_i\left(x\right)+g\left(x\right)\right\}\end{array}$$

(1)

and

$$\begin{array}{c}\hfill \genfrac{}{}{0pt}{}{min}{x\in \mathcal{H}}\left\{\sum _{i=1}^n{f}_i\left(x\right)\right\}\end{array}$$

(2)

where each $f_i$ is a lower semicontinuous, and proper and convex functions on $\mathcal{H}$ and g is differentiable with the $1/\beta$-Lipschitz gradient. As described in [1], the discussion can be conducted in a general setting where problems (1) and (2) are special instances of those that follow, respectively:

$$\begin{array}{c}\hfill \mathrm{find} \mathrm{a},\mathrm{such} \mathrm{that}a\in zer(\sum _{i=1}^n{A}_i+B),\end{array}$$

(3)

$$\begin{array}{c}\hfill \mathrm{find} \mathrm{a},\mathrm{such} \mathrm{that}a\in zer\left(\sum _{i=1}^n{A}_i\right),\end{array}$$

(4)

where $A_i$ is the maximal monotone and $\beta B$ is firmly nonexpansive. The main purpose of this paper is to present algorithms to solve these inclusions and consider the convergence of the proposed methods.

Finding the zeros of an operator is a crucial task in operator theory [1,2]. A number of ideas have been proposed to address the issue of when the operator is decomposed into a sum of two. For instance, Ref. [3] developed the forward–backward method to solve when one of the operator is the maximal monotone and the other is firmly nonexpansive. We remark that by this, we gain a solution (3) in the case $n=1$. On the other hand, in the case of when each of the two operators is maximal monotone, the authors of [4] presented the Douglas–Rachford method, while the authors of [5] developed the splitting operator. Likewise, we remark that it happens to be the special case of problem (4) for the case of $n=2.$ Details of these two algorithms can be found in Section 2.2.

It is rather difficult to extend the forward–backward method to address problem (3) for a general n. Nevertheless, in [6], the authors achieved an algorithm. This proves to be covered by the four kinds of generalized forward–backward method given in this paper.

As for problem (4), extension variants of the Douglas–Rachford method have emerged. Most of them rely on reducing the original problem to the simple case of $n=2$ by introducing auxiliary variables. In this paper, we point out that this problem can be solved by applying the generalized forward–backward method described above with $B=0$. Additionally, we prove that this method can also be explained as a reduction in the original problem for the case $n=2$. A benefit of this observation is that we can design splitting operators which allow us to solve (4) by the proximal point algorithm. The work of [7] is also included in this paper. For recent improvements in this field, please refer to references [8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24].

This paper is divided into five sections. The conception of the product space as well as some of the operators on it are introduced in Section 2. To address the general problem, we will review in this section some classical methods for finding the zeros of a sum of two operators. Section 3 is devoted to solving problem (3) by deriving fixed-point equations. In this process, we obtain the so called generalized forward–backward splitting methods. In Section 4, we solve problem (4) from two different perspectives. Firstly, we view it as an instance of (3), so we obtain fixed-point equations as a consequence of the generalized forward–backward methods. Secondly, we point out by introducing new operators on the product space that this problem can be reduced to the case of $n=2$, which has been solved in Section 2. Based on this, we can obtain fixed-point equations in another way and we can generate splitting operators with good properties. We provide in Section 5 iterative schemes which produce convergent sequences, and these sequences eventually lead to solutions of either problem (3) or (4).

2. Foundations

In this section, we shall introduce some notations to elaborate problems (3) and (4). Also, existing work which can be used to address these two problems for a special n will be reviewed.

2.1. Notations and Definitions

We begin by introducing some notations and properties of operators on $\mathcal{H}$.

Definition 1 

([1]). Let A be a set-valued operator $A:\mathcal{H}\to 2^{\mathcal{H}}$, where the graph of A is defined as the set $gra\left(A\right)=\{(x,y)\in {\mathcal{H}}^2:y\in Ax\}$. No distinctions between an operator and its graph are made, that is, $(x,y)\in A$ denotes $y\in Ax$. Its inverse $A^{-1}$ is defined as $(x,y)\in A^{-1}\iff (y,x)\in A.$ The zeros of A is defined as

$$zer\left(A\right)=A^{-1}\left(0\right)=\{x\in \mathcal{H}:(x,0)\in A\}=\{x\in \mathcal{H}:0\in Ax\}.$$

The domain and range of A are, respectively,

$$dom\left(A\right)=\{x\in \mathcal{H}:Ax\ne \varnothing \},im\left(A\right)=\{y:\exists x\in \mathcal{H},(x,y)\in A\}.$$

Definition 2 

([1]). An operator $A:\mathcal{H}\to 2^{\mathcal{H}}$ is single-valued if $\forall x\in \mathcal{H},$ and the cardinality of $Ax$ is at most 1.

Definition 3 

([1]). If $A,B:\mathcal{H}\to 2^{\mathcal{H}}$ are two set-valued operators on $\mathcal{H}$, the resolvent $J_A$ and the reflection operator $R_A$ are defined, respectively, as

$$\begin{array}{c}\hfill \begin{array}{c}{J}_A={(\mathrm{Id}+A)}^{-1},R_A=2J_A-\mathrm{Id}.\hfill \end{array}\end{array}$$

Throughout this paper, let $\mathrm{Id}$ denote the identity operator on the appropriate Hilbert space.

Definition 4 

([1]). An operator $A:\mathcal{H}\to 2^{\mathcal{H}}$ is monotone if $\langle \tilde{y}-y,\tilde{x}-x\rangle \ge 0,\forall (x,y),(\tilde{x},\tilde{y})\in A.$ Moreover, A is maximal monotone if its graph is not strictly contained in any other monotone operator.

Definition 5 

([1]). An operator $A:\mathcal{H}\to 2^{\mathcal{H}}$ is nonexpansive if

$$\parallel \tilde{y}-y\parallel \le \parallel \tilde{x}-x\parallel \forall (x,y),(\tilde{x},\tilde{y})\in A.$$

Let $\alpha \in (0,1).$ An operator A is α-averaged nonexpansive if there exists a nonexpansive operator R such that $A=(1-\alpha )\mathrm{Id}+\alpha R$. In this case, we use the notation $A\in \mathcal{A}\left(\alpha \right)$.

Definition 6 

([1]). An operator $A:\mathcal{H}\to 2^{\mathcal{H}}$ is firmly nonexpansive if

$$\parallel \tilde{y}{-y\parallel }^2\le \langle \tilde{y}-y,\tilde{x}-x\rangle ,\forall (x,y),(\tilde{x},\tilde{y})\in A.$$

Furthermore, A is firmly nonexpansive if and only if $A\in \mathcal{A}\left(\frac{1}{2}\right)$.

Lemma 1 

([1]). Let $A:\mathcal{H}\to 2^{\mathcal{H}}$ be a monotone operator, then it is maximal monotone if and only if $im(\mathrm{Id}+A)=\mathcal{H}.$

Lemma 2 

([1]). Let $A:\mathcal{H}\to 2^{\mathcal{H}}$ be such that $dom\left(A\right)\ne \varnothing ,$ set $D=im(\mathrm{Id}+A)$, and $T=J_A|D$. Then, A is maximal monotone if and only if T is firmly nonexpansive and $D=\mathcal{H}$.

2.2. Product Space

Let ${\omega }_j$ be positive constants such that ${\displaystyle \sum _{j=1}^n}{\omega }_j=1$, and we define the product space ${\mathcal{H}}^n$ endowed with the following scalar product $\forall \mathbf{x}={\left(x_i\right)}_{i=1}^n,\mathbf{y}={\left(y_i\right)}_{i=1}^n\in {\mathcal{H}}^n,\langle \mathbf{x},\mathbf{y}\rangle :={\sum }_{i=1}^n{\omega }_i\langle x_i,y_i\rangle$ and the corresponding norm. Below are some elementary operators in the product space ${\mathcal{H}}^n$. Let K be a subspace of ${\mathcal{H}}^n$, and ${\mathbf{K}}^{\perp }$, $N_{\mathbf{K}}$ be its orthogonal complementary, the normal cone operator, respectively:

$$\begin{array}{c}\hfill \begin{array}{c}\mathbf{K}=\{(x_1,\dots ,x_n):x_i\in \mathcal{H},x_1=\dots =x_n\},\hfill \\ {\mathbf{K}}^{\perp }=\{(x_1,\dots ,x_n):x_i\in \mathcal{H},\sum _{i=1}^n{\omega }_i{x}_i=0\},\hfill \\ N_{\mathbf{K}}\left(\mathbf{x}\right)=\{\begin{array}{cc}{\mathbf{K}}^{\perp }\hfill & \mathbf{x}\in \mathbf{K};\hfill \\ \varnothing \hfill & otherwise.\hfill \end{array}\hfill \end{array}\end{array}$$

(5)

Moreover, let $A_i,B$ be operators given in (3), whereby two operators $\Gamma \mathbf{A}$ and $\mathbf{B}$ on ${\mathcal{H}}^n$ are defined as follows: for $\mathit{x}={\left(x_i\right)}_{i=1}^n,\mathit{y}={\left(y_i\right)}_{i=1}^n,$

$$(\mathbf{x},\mathbf{y})\in \Gamma \mathbf{A}\iff (x_i,y_i)\in \frac{\gamma A_i}{{\omega }_i}and\mathbf{y}=\mathbf{B}\mathbf{x}\iff y_i=B{x}_i.$$

(6)

It is easy to establish that $\Gamma \mathbf{A}$ is maximal monotone, and $\beta \mathbf{B}\in \mathcal{A}(1/2)$ is thus single-valued.

Lemma 3 

([1]). Define the canonical isometry $C:\mathcal{H}\to \mathit{K}$ as $C\left(x\right):=(x,\dots ,x).$ Then, for any $\mathit{z}\in {\mathcal{H}}^n$, the following statements hold:

(i) 

$J_{N_{\mathit{K}}}\mathit{z}=C\left({\sum }_{i=1}^n{\omega }_i{z}_i\right)$,$R_{N_{\mathit{K}}}\mathit{z}=C\left({\sum }_{i=1}^n{\omega }_i{z}_i\right)-\mathit{z}$;

(ii) 

Let $\mathit{u}\in \mathit{K},$ then $R_{N_{\mathit{K}}}\mathit{u}=\mathit{u}$.

(iii) 

$R_{\Gamma \mathit{A}}\mathit{z}={\left(R_{\frac{\gamma A_i}{{\omega }_i}}\left(z_i\right)\right)}_{i=1}^n$.

Lemma 4. 

Let $u_i,v_i,i=1,\dots ,n$ be elements in $\mathcal{H}$, then

$$\begin{array}{c}\hfill u_i=2\sum _{j=1}^n{\omega }_j{v}_j-v_i,1\le i\le n.\iff v_i=2\sum _{j=1}^n{\omega }_j{u}_j-u_i,1\le i\le n.\end{array}$$

Proof. 

This relation can be verified by applying a weighted sum on both sides of the equations. □

Below is an equivalent form of the last lemma in the product space.

Lemma 5. 

Let $\mathit{u},\mathit{v}\in {\mathcal{H}}^n$, then $\mathit{u}=R_{N_{\mathit{K}}}\mathit{v}$ if and only if $\mathit{v}=R_{N_{\mathit{K}}}\mathit{u}$.

2.3. Zeros of a Sum of Two Operators

In this subsection, we will review some classical methods to find the zeros of a sum of two operators, i.e.,

$$\begin{array}{c}\hfill \mathrm{find}x\in \mathcal{H}\mathrm{such} \mathrm{that}0\in Ax+Bx.\end{array}$$

(7)

When A is maximal monotone and B is firmly nonexpansive, we find that the inclusion (7) is equivalent to the next fixed-point equation. The corresponding operator T is called the forward–backward splitting operator.

Lemma 6. 

Let A be maximal monotone and B be firmly nonexpansive. Define

$$\begin{array}{c}\hfill T:=J_{\gamma A}(\mathrm{Id}-\gamma B),\end{array}$$

(8)

then

$$\begin{array}{c}\hfill x\in zer(A+B)\iff x=Tx.\end{array}$$

(9)

When A and B are both maximal monotone, we propose two fixed-point equations to solve problem (7).

Lemma 7. 

Let A and B be maximal monotone, then $x\in zer(A+B)$ if and only if $x=J_{B}z$ and z is a fixed point of the following firmly nonexpansive operator $G_{A,B}={\displaystyle \frac{\mathrm{Id}+R_A{R}_B}{2}}$.

Lemma 8. 

Let A and B be maximal monotone, then $x\in zer(A+B)$ if and only if $x=J_{B}z$ and z is a fixed point of the following firmly nonexpansive operator $G_{\gamma ,A,B}$,

$$\begin{array}{c}\hfill G_{\gamma ,A,B}:=J_{\gamma A}(2J_{\gamma B}-\mathrm{Id})+(\mathrm{Id}-J_{\gamma B}).\end{array}$$

(10)

The operator $G_{\gamma ,A,B}$ is called the Douglas–Rachford splitting operator and it was presented by Lions and Mercier [4]. It is well known that $G_{\gamma ,A,B}$ is firmly nonexpansive; thus, Lemma 2 says that there exists a maximal monotone operator $S_{\gamma ,A,B}$ such that $G_{\gamma }=J_{S_{\gamma ,A,B}}$. In [5], Jonathan Eckstein constructed his splitting operator as follows:

$$\begin{array}{c}\hfill S_{\gamma ,A,B}=\left\{(v+\lambda b,u-v)\left|\right(u,b)\in B,(v,a)\in A,v+\lambda a=u-\lambda b\right\}.\end{array}$$

(11)

3. Generalized Forward–Backward Methods

In this section, we consider the problem (3). Recall that in Proposition 6, we dealt with this problem for $n=1$ by deriving a fixed-point equation. We shall develop variant fixed-point equations and algorithms for general n.

3.1. Fixed-Point Equations on $\mathcal{H}$

Proposition 1. 

Let $a\in \mathcal{H}$, then $a\in zer({\sum }_{i=1}^n{A}_i+B)$ if and only if there exists $v_j\in \mathcal{H},$$1\le j\le n,$ such that

$$\left\{\begin{array}{c}a=\gamma Ba+\sum _{j=1}^n{\omega }_j{v}_j,\hfill \\ a=J_{\frac{\gamma A_i}{{\omega }_i}}\left(v_i\right),1\le i\le n.\hfill \end{array}\right.$$

(12)

Proof. 

By definition, we have $a\in zer({\sum }_{i=1}^n{A}_i+B)$⇔$0\in \gamma Ba+{\sum }_{j=1}^n\gamma A_{j}a$ ⇔$\exists {\theta }_j\in \frac{\gamma A_j}{{\omega }_j}a,0=\gamma Ba+{\sum }_{j=1}^n{\omega }_j{\theta }_j.$ In addition, ${\theta }_j\in \frac{\gamma A_j}{{\omega }_j}a$ if and only if $a=J_{\frac{\gamma A_j}{{\omega }_j}}(a+{\theta }_j)$. Thus, we obtain the equivalent condition (12) by denoting $v_j:=a+{\theta }_j$. In the above and later discussions, note that B is a single-valued operator which can be established from $\beta B\in \mathcal{A}(1/2)$. □

As a direct consequence of this proposition, we have the following result.

Proposition 2. 

Let $a\in \mathcal{H}$, then $a\in zer({\sum }_{i=1}^n{A}_i+B)$ if and only if there exists $z_j\in \mathcal{H},$$1\le j\le n,$ such that

$$\left\{\begin{array}{c}a=\sum _{j=1}^n{\omega }_j{z}_j,\hfill \\ a=J_{\frac{\gamma A_i}{{\omega }_i}}(2a-\gamma Ba-z_i),1\le i\le n.\hfill \end{array}\right.$$

(13)

Proof. 

Let $z_i:=2a-\gamma Ba-v_i$ in Equation (12). □

Proposition 3. 

Let $a\in \mathcal{H}$, then $a\in zer({\sum }_{i=1}^n{A}_i+B)$ if and only if there exists $z_j\in \mathcal{H},$$1\le j\le n,$ such that

$$\left\{\begin{array}{c}a=\gamma Ba+\sum _{j=1}^n{\omega }_j{z}_j,\hfill \\ a=J_{\frac{\gamma A_i}{{\omega }_i}}(2\sum _{j=1}^n{\omega }_j{z}_j-z_i),1\le i\le n.\hfill \end{array}\right.$$

(14)

Proof. 

Let $z_i:=2{\sum }_{j=1}^n{\omega }_j{v}_j-v_i$ in Equation (12). □

Proposition 4. 

Let $a\in \mathcal{H}$, then $a\in zer({\sum }_{i=1}^n{A}_i+B)$ if and only if there exists $z_j\in \mathcal{H},$$1\le j\le n,$ such that

$$\left\{\begin{array}{c}a=\sum _{j=1}^n{\omega }_j{z}_j\hfill \\ a=J_{\frac{\gamma A_i}{{\omega }_i}}(z_i-\gamma Ba),1\le i\le n.\hfill \end{array}\right.$$

(15)

Proof. 

Let $z_i:=v_i+\gamma Ba$ in Equation (12). □

3.2. Fixed-Point Equations on the Product Space ${\mathcal{H}}^n$

In this subsection, the fixed-point Equations (12)–(15) will be further studied. Firstly, we define four operators on the product space ${\mathcal{H}}^n$.

Definition 7. 

Let $\mathit{z}:={\left(z_i\right)}_{i=1}^n$. Define four operators $T_1,T_2,T_3,T_4:{\mathcal{H}}^n\to {\mathcal{H}}^n$ as follows:

$$\begin{array}{cc}\hfill {\left(T_1\mathit{z}\right)}_i:=& z_i+J_{\frac{\gamma A_i}{{\omega }_i}}(2x-\gamma Bx-z_i)-x,\hfill \end{array}$$

(16)

$$\begin{array}{cc}\hfill {\left(T_2\mathit{z}\right)}_i:=& -x+z_i+J_{\frac{\gamma A_i}{{\omega }_i}}(2x-z_i)-\gamma B\left[\sum _{j=1}^n{\omega }_j{J}_{\frac{\gamma A_j}{{\omega }_j}}(2x-z_j)\right],\hfill \end{array}$$

(17)

$$\begin{array}{cc}\hfill {\left(T_3\mathit{z}\right)}_i:=& z_i-x+2\sum _{j=1}^n{\omega }_j{J}_{\frac{\gamma A_j}{{\omega }_j}}\left(z_j\right)-J_{\frac{\gamma A_i}{{\omega }_i}}\left(z_i\right)-\gamma B\left[\sum _{j=1}^n{\omega }_j{J}_{\frac{\gamma A_j}{{\omega }_j}}\left(z_j\right)\right],\hfill \end{array}$$

(18)

$$\begin{array}{cc}\hfill {\left(T_4\mathit{z}\right)}_i:=& z_i-x+2\sum _{j=1}^n{\omega }_j{J}_{\frac{\gamma A_j}{{\omega }_j}}(z_j-\gamma Bx)-J_{\frac{\gamma A_i}{{\omega }_i}}(z_i-\gamma Bx).\hfill \end{array}$$

(19)

where $x:={\sum }_{j=1}^n{\omega }_j{z}_j$ and $1\le i\le n.$

Analogous to the forward–backward operator T in (8), these four operators are called generalized forward–backward splitting operators. We propose below the new fixed-point equations in the product space.

Proposition 5. 

Let $a\in \mathcal{H}$, then $a\in zer({\sum }_{i=1}^n{A}_i+B)$ if and only if there exists some $\mathit{z}={\left(z_i\right)}_{i=1}^n\in {\mathcal{H}}^n$ such that any of the following equations holds:

(i) 

$$\left\{\begin{array}{c}a=\sum _{j=1}^n{\omega }_j{z}_j,\hfill \\ T_1\mathit{z}=\mathit{z}.\hfill \end{array}\right.$$

(20)

(ii) 

$$\left\{\begin{array}{c}a=J_{\frac{\gamma A_i}{{\omega }_i}}(2\sum _{j=1}^n{\omega }_j{z}_j-z_i),1\le i\le n,\hfill \\ T_2\mathit{z}=\mathit{z}.\hfill \end{array}\right.$$

(21)

(iii) 

$$\left\{\begin{array}{c}a=J_{\frac{\gamma A_i}{{\omega }_i}}\left(z_i\right),1\le i\le n,\hfill \\ T_3\mathit{z}=\mathit{z}.\hfill \end{array}\right.$$

(22)

(iv) 

$$\left\{\begin{array}{c}a=\sum _{j=1}^n{\omega }_j{z}_j,\hfill \\ T_4\mathit{z}=\mathit{z}.\hfill \end{array}\right.$$

(23)

Proof. 

(i) In the proofs of all the four parts, we only prove the sufficiency since the necessity can be obtained readily. Assume $T_1\mathbf{z}=\mathbf{z}$, then

$$\begin{array}{c}\hfill x=J_{\frac{\gamma A_i}{{\omega }_i}}(2x-z_i-\gamma Bx),x=\sum _{j=1}^n{\omega }_j{z}_j.\end{array}$$

(24)

Combining this with the first identity of (20), we have $a=x$ so that relation (13) holds.

(ii)

Assume that $T_2\mathbf{z}=\mathbf{z}$, then

$$\begin{array}{c}\hfill x=J_{\frac{\gamma A_i}{{\omega }_i}}(2x-z_i)-\gamma B\left[\sum _{j=1}^n{\omega }_j{J}_{\frac{\gamma A_j}{{\omega }_j}}(2x-z_j)\right],x=\sum _{j=1}^n{\omega }_j{z}_j.\end{array}$$

(25)

Let $a_i:=J_{\frac{\gamma A_i}{{\omega }_i}}(2x-z_i),$ then the first identity of Equation (25) is rewritten as

$$x=a_i-\gamma B\left(\sum _{j=1}^n{\omega }_j{a}_j\right).$$

(26)

This, combined with (25), implies that there exists $b\in \mathcal{H}$ such that

$$b=a_i=J_{\frac{\gamma A_i}{{\omega }_i}}(2x-z_i),1\le i\le n,x=b-\gamma Bb.$$

Comparing with the first identity of relation (21), we achieve that $a=b$, so we gain Equation (14).

(iii)

Assume that $T_3\mathbf{z}=\mathbf{z}$, then

$$\begin{array}{c}\hfill x=2\sum _{j=1}^n{\omega }_j{J}_{\frac{\gamma A_j}{{\omega }_j}}\left(z_j\right)-J_{\frac{\gamma A_i}{{\omega }_i}}\left(z_i\right)-\gamma B\left[\sum _{j=1}^n{\omega }_j{J}_{\frac{\gamma A_j}{{\omega }_j}}\left(z_j\right)\right],x=\sum _{j=1}^n{\omega }_j{z}_j.\end{array}$$

(27)

Let $a_i:=J_{\frac{\gamma A_i}{{\omega }_i}}\left(z_i\right),$ then we have

$$x=2\sum _{j=1}^n{\omega }_j{a}_j-a_i-\gamma B\left(\sum _{j=1}^n{\omega }_j{a}_j\right).$$

(28)

Thus, there exists $b\in \mathcal{H}$ such that $b=a_i=J_{\frac{\gamma A_i}{{\omega }_i}}\left(z_i\right),i=1,\dots ,n,$ and $x=2b-b-\gamma Bb=b-\gamma Bb.$ This, combined with the first identity of (22), implies that $a=b$. And, by substituting $z_i$ with $v_i$, we can obtain relation (12).

(iv)

Assume that $T_4\mathbf{z}=\mathbf{z}$, then we have

$$\begin{array}{c}\hfill x=2\sum _{j=1}^n{\omega }_j{J}_{\frac{\gamma A_j}{{\omega }_j}}(z_j-\gamma Bx)-J_{\frac{\gamma A_i}{{\omega }_i}}(z_i-\gamma Bx),x=\sum _{j=1}^n{\omega }_j{z}_j.\end{array}$$

(29)

It is readily deduced from the first identity that $x=J_{\frac{\gamma A_i}{{\omega }_i}}(z_i-\gamma Bx),i1\le i\le n.$ Moreover, by the first identity of relation (23), we have $a=x$. Thus, we obtain relation (15).

□

3.3. Characterization of Forward–Backward Splitting Operators

Proposition 6. 

Let $T_1,T_2,T_3,T_4$ be defined in Definition 7; then, we have

$$\begin{array}{c}\hfill T_1=\frac{\left(\mathrm{Id}+R_{\Gamma \mathit{A}}{R}_{N_{\mathit{K}}}\right)}{2}\circ \left(\mathrm{Id}-\gamma \mathit{B}{J}_{N_{\mathit{K}}}\right),\end{array}$$

(30)

$$\begin{array}{c}\hfill T_2=\left(\mathrm{Id}-\gamma \mathit{B}{J}_{N_{\mathit{K}}}\right)\circ \frac{\left(\mathrm{Id}+R_{\Gamma \mathit{A}}{R}_{N_{\mathit{K}}}\right)}{2},\end{array}$$

(31)

$$\begin{array}{c}\hfill T_3=\left(\mathrm{Id}-\gamma \mathit{B}{J}_{N_{\mathit{K}}}\right)\circ \frac{\left(\mathrm{Id}+R_{N_{\mathit{K}}}{R}_{\Gamma \mathit{A}}\right)}{2},\end{array}$$

(32)

$$\begin{array}{c}\hfill T_4=\frac{\left(\mathrm{Id}+R_{N_{\mathit{K}}}{R}_{\Gamma \mathit{A}}\right)}{2}\circ \left(\mathrm{Id}-\gamma \mathit{B}{J}_{N_{\mathit{K}}}\right).\end{array}$$

(33)

Proof. 

(i) Let $\mathbf{u}:={\left(u_i\right)}_{i=1}^n$ with $u_i=z_i-\gamma Bx,$ then, we can check that

$$\begin{array}{c}\hfill \mathbf{u}=\mathbf{z}-\gamma \mathbf{B}{J}_{N_{\mathbf{K}}}\mathbf{z},\\ \hfill 2x-z_i-\gamma Bx=2(x-\gamma Bx)-(z_i-\gamma Bx)=2\sum _{j=1}^n{\omega }_j{u}_j-u_i.\end{array}$$

(34)

Moreover, definition (16) can be written equivalently as

$${\left(T_1\mathbf{z}\right)}_i=\left(R_{\frac{\gamma A_i}{{\omega }_i}}(2x-z_i-\gamma Bx)+z_i-\gamma Bx\right)/2.$$

(35)

These results lead to

$${\left(T_1\mathbf{z}\right)}_i=\frac{R_{\frac{\gamma A_i}{{\omega }_i}}(2{\sum }_{j=1}^n{\omega }_j{u}_j-u_i)+u_i}{2},$$

or equivalently

$$T_1\mathbf{z}=\frac{R_{\Gamma \mathbf{A}}{R}_{N_{\mathbf{K}}}\mathbf{u}+\mathbf{u}}{2}.$$

By noting (34), we can obtain relation (30).

(ii)

Let $\mathbf{u}:={\left(u_i\right)}_{i=1}^n$ with $u_i=\left(z_i+R_{\frac{\gamma A_i}{{\omega }_i}}(2x-z_i)\right)/2,$ then, we can check that

$$\begin{array}{c}\hfill -x+z_i+J_{\frac{\gamma A_i}{{\omega }_i}}(2x-z_i)=u_i,\sum _{j=1}^n{\omega }_j{J}_{\frac{\gamma A_j}{{\omega }_j}}(2x-z_j)=\sum _{j=1}^n{\omega }_j{u}_j.\end{array}$$

(36)

Thus, we can deduce from (17) that ${\left(T_2\mathbf{z}\right)}_i=u_i-\gamma B\left({\sum }_{j=1}^n{\omega }_j{u}_j\right),$ i.e.,

$$T_2\mathbf{z}=(\mathrm{Id}-\gamma \mathbf{B}{J}_{N_{\mathbf{K}}})\mathbf{u}.$$

(37)

Combining this with the fact that $\mathbf{u}=\left(\mathbf{z}+R_{\Gamma \mathbf{A}}{R}_{N_{\mathbf{K}}}\mathbf{z}\right)/2$, we can verify the equality (31).

(iii)

Let $\mathbf{u}:={\left(u_i\right)}_{i=1}^n$ with $u_i=z_i-x+2{\sum }_{j=1}^n{\omega }_j{J}_{\frac{\gamma A_j}{{\omega }_j}}\left(z_j\right)-J_{\frac{\gamma A_i}{{\omega }_i}}\left(z_i\right),$ then we can check that ${\sum }_{j=1}^n{\omega }_j{J}_{\frac{\gamma A_j}{{\omega }_j}}\left(z_j\right)={\sum }_{j=1}^n{\omega }_j{u}_j.$ Furthermore, we have

$$\begin{array}{c}\hfill u_i=\left(z_i+2\sum _{j=1}^n{\omega }_j{R}_{\frac{\gamma A_j}{{\omega }_j}}\left(z_j\right)-R_{\frac{\gamma A_i}{{\omega }_i}}\left(z_i\right)\right)/2,\end{array}$$

(38)

or equivalently,

$$\begin{array}{c}\hfill \mathbf{u}=\frac{\mathbf{z}+R_{N_{\mathbf{K}}}{R}_{\Gamma \mathbf{A}}\mathbf{z}}{2}.\end{array}$$

(39)

So, it can be induced from definition (18) that

$${\left(T_3\mathbf{z}\right)}_i=u_i-\gamma B\left(\sum _{j=1}^n{\omega }_j{u}_j\right),$$

and thus,

$$\begin{array}{c}\hfill T_3\mathbf{z}=\left(\mathrm{Id}-\gamma \mathbf{B}{J}_{N_{\mathbf{K}}}\right)\mathbf{u}=\left(\mathrm{Id}-\gamma \mathbf{B}{J}_{N_{\mathbf{K}}}\right)\frac{\left(\mathrm{Id}+R_{N_{\mathbf{K}}}{R}_{\Gamma \mathit{A}}\right)}{2}\mathbf{z}.\end{array}$$

(40)

(iv)

It is readily induced from (19) that

$${\left(T_4\mathbf{z}\right)}_i=\left(z_i-\gamma Bx+2\sum _{j=1}^n{\omega }_j{R}_{\frac{\gamma A_j}{{\omega }_j}}(z_j-\gamma Bx)-R_{\frac{\gamma A_i}{{\omega }_i}}(z_i-\gamma Bx)\right)/2.$$

(41)

Let $\mathbf{u}:={\left(u_i\right)}_{i=1}^n$ with $u_i=z_i-\gamma Bx;$ then, we can check that $\mathbf{u}=\mathbf{z}-\gamma \mathbf{B}{J}_{N_{\mathbf{K}}}\mathbf{z}$ and

$$\begin{array}{c}\hfill {\left(T_4\mathbf{z}\right)}_i=\left(u_i+2\sum _{j=1}^n{\omega }_j{R}_{\frac{\gamma A_j}{{\omega }_j}}\left(u_j\right)-R_{\frac{\gamma A_i}{{\omega }_i}}\left(u_i\right)\right)/2.\end{array}$$

(42)

In other words, we gain

$$T_4\mathbf{z}=\frac{\left(\mathbf{u}+R_{N_{\mathbf{K}}}{R}_{\Gamma \mathbf{A}}\mathbf{u}\right)}{2}=\frac{\left(\mathrm{Id}+R_{N_{\mathbf{K}}}{R}_{\Gamma \mathbf{A}}\right)}{2}\left(\mathrm{Id}-\gamma \mathbf{B}{J}_{N_{\mathbf{K}}}\right)\mathbf{u}.$$

(43)

□

Lemma 9 

([1]). For any $\gamma >0,\beta >\frac{\gamma }{2},$ we have

$$\frac{\mathrm{Id}+R_{\Gamma \mathit{A}}{R}_{N_{\mathit{K}}}}{2},\frac{\mathrm{Id}+R_{N_{\mathit{K}}}{R}_{\Gamma \mathit{A}}}{2}\in \mathcal{A}(1/2),\mathrm{Id}-\gamma \mathit{B}{J}_{N_{\mathit{K}}}\in \mathcal{A}(\gamma /2\beta ).$$

(44)

Proposition 7. 

Let $T_1,T_2,T_3,T_4$ be defined in Definition 7. For any $\gamma >0,\beta >\frac{\gamma }{2},$ define $\alpha :=max(\frac{2}{3},\frac{2}{1+2\beta /\gamma }),$ then each $T_i$ is α-averaged nonexpansive.

Proof. 

It follows from [6], Proposition 4.6. □

Note that a fixed-point equation for problem (3) was also proposed in [6]. We remark that the associated operator in that context is nothing but $T_1$ in our work; thus, we have covered the method given by [6].

4. Zeros of a Sum of n Maximal Monotone Operators

The main focus of this section is to present fixed-point equations as well as algorithms to solve problem (4).

4.1. An Application of the Generalized Forward–Backward Methods

Observe that it can be identified as a special instance of problem (3) with $B=0$, so we can apply the methods given in Proposition 5 to obtain a solution. In this case, the operators $T_1,T_2$ are simplified to P, and $T_3,T_4$ to Q, respectively:

$$\begin{array}{c}\hfill P=\frac{\mathrm{Id}+R_{\Gamma \mathbf{A}}{R}_{N_{\mathbf{K}}}}{2},Q=\frac{\mathrm{Id}+R_{N_{\mathbf{K}}}{R}_{\Gamma \mathbf{A}}}{2}.\end{array}$$

(45)

The following results are a direct consequence of Lemma 9 and Proposition 5.

Proposition 8. 

Let $x\in \mathcal{H}$, then $x\in zer\left({\sum }_{j=1}^n{A}_j\right)$ if and only if there exists $\mathit{z}={\left(z_j\right)}_{j=1}^n$ such that $\mathit{z}$ is a fixed point of P or Q and $x={\sum }_{j=1}^n{\omega }_j{z}_j$.

Proposition 9. 

The operators P and Q are both firmly nonexpansive.

We also present some properties of the fixed points of the operators P and Q.

Lemma 10. 

Let $\mathit{z}={\left(z_j\right)}_{j=1}^n$ be a fixed point of the operator P, then we have

$$\begin{array}{c}\hfill \sum _{j=1}^n{\omega }_j{z}_j=J_{\frac{\gamma A_i}{{\omega }_i}}(\sum _{j=1}^{n}2{\omega }_j{z}_j-z_i),1\le i\le n.\end{array}$$

(46)

Proof. 

It suffices to prove that $J_{N_{\mathbf{K}}}\mathbf{z}=J_{\Gamma \mathbf{A}}{R}_{N_{\mathbf{K}}}\mathbf{z}$. By assumption, we have $\mathbf{z}=R_{\Gamma \mathbf{A}}{R}_{N_{\mathbf{K}}}\mathbf{z}$. So, we obtain that $\mathbf{z}=2J_{\Gamma \mathbf{A}}{R}_{N_{\mathbf{K}}}\mathbf{z}-R_{N_{\mathbf{K}}}\mathbf{z}$ thus $J_{N_{\mathbf{K}}}\mathbf{z}=J_{\Gamma \mathbf{A}}{R}_{N_{\mathbf{K}}}\mathbf{z}.$ □

Lemma 11. 

Let $\mathit{z}={\left(z_j\right)}_{j=1}^n$ be a fixed point of the operator Q, then we have

$$\begin{array}{c}\hfill \sum _{j=1}^n{\omega }_j{z}_j=J_{\frac{\gamma A_i}{{\omega }_i}}{z}_i,1\le i\le n.\end{array}$$

(47)

Proof. 

It suffices to prove that $J_{N_{\mathbf{K}}}\mathbf{z}=J_{\Gamma \mathbf{A}}\mathbf{z}$. By assumption, we have $\mathbf{z}=R_{N_{\mathbf{K}}}{R}_{\Gamma \mathbf{A}}\mathbf{z}$. It can be induced from the linearity of the operator $R_{N_{\mathbf{K}}}$ that $\mathbf{z}=2R_{N_{\mathbf{K}}}{J}_{\Gamma \mathbf{A}}\mathbf{z}-R_{N_{\mathbf{K}}}\mathbf{z}$, and thus, $J_{N_{\mathbf{K}}}\mathbf{z}=R_{N_{\mathbf{K}}}{J}_{\Gamma \mathbf{A}}\mathbf{z}.$ So, we obtain that $J_{\Gamma \mathbf{A}}\mathbf{z}=R_{N_{\mathbf{K}}}{J}_{N_{\mathbf{K}}}\mathbf{z}=J_{N_{\mathbf{K}}}\mathbf{z}.$ Note that the first and second identities hold due two Proposition 5 and (ii) of Proposition 3, respectively. □

It seems that we have solved the problem perfectly. Nevertheless, we shall investigate what the intrinsic mode is. This research is conducted from a distinctive perspective.

4.2. Reformulation of Fixed-Point Equations

We shall begin with a crucial proposition which reveals that finding the zero of the sum of n maximal monotone operators can be reduced to the simple case of $n=2$.

Proposition 10. 

Let $x\in H,$ then $x\in zer\left({\sum }_{j=1}^n{A}_j\right)$ if and only if $\mathit{x}\in zer\left((\Gamma \mathit{A}+N_{\mathit{K}})\right)$ with $\mathit{x}=(x,\dots ,x)$.

Proof. 

We investigate problem (4) as follows:

$$\begin{array}{c}\hfill 0\in \sum _{j=1}^n{A}_{j}x\iff \left\{\begin{array}{c}0\in \sum _{j=1}^n{A}_j{x}_j,\hfill \\ x_1=\dots =x_n.\hfill \end{array}\right.\iff \left\{\begin{array}{c}{x}_1=\dots =x_n,\hfill \\ \exists {\theta }_j\in \mathcal{H},-{\theta }_j\in \frac{\gamma A_j}{{\omega }_j}{x}_j.\hfill \\ \sum _{j=1}^n{\omega }_j{\theta }_j=0.\hfill \end{array}\right.\end{array}$$

(48)

Define $\mathit{x}:=(x_1,\dots ,x_n),$ then we obtain an equivalent relation

$$\begin{array}{c}\hfill \mathbf{0}\in (\Gamma \mathbf{A}+N_{\mathbf{K}})\mathbf{x}.\end{array}$$

(49)

□

Based on the above discussions, we can regain Proposition 8 by an alternative approach.

Proposition 11. 

Let $x\in \mathcal{H}$, then $x\in zer\left({\sum }_{j=1}^n{A}_j\right)$ if and only if there exists $\mathit{z}={\left(z_j\right)}_{j=1}^n$ such that $\mathit{z}$ is a fixed point of P and $x={\sum }_{j=1}^n{\omega }_j{z}_j$.

Proof. 

Let $\mathbf{x}:=(x,\dots ,x),$ then by Lemma 7, $\mathbf{x}\in zer\left((\Gamma \mathbf{A}+N_{\mathbf{K}})\right)$ is equivalent to

$$\begin{array}{c}\hfill \mathbf{z}=\frac{\mathrm{Id}+R_{\Gamma \mathbf{A}}{R}_{N_{\mathbf{K}}}}{2}\mathbf{z},\mathbf{x}=J_{N_{\mathbf{K}}}\mathbf{z}.\end{array}$$

(50)

Note that the second identity states that $x={\sum }_{j=1}^n{\omega }_j{z}_j$, and thus, we conclude from Lemma 10 that $x\in zer\left({\sum }_{j=1}^n{A}_j\right)$. □

Proposition 12. 

Let $x\in \mathcal{H}$, then $x\in zer\left({\sum }_{j=1}^n{A}_j\right)$ if and only if there exists $\mathit{z}={\left(z_j\right)}_{j=1}^n$ such that $\mathit{z}$ is a fixed point of Q and $x={\sum }_{j=1}^n{\omega }_j{z}_j$.

Proof. 

Similar to the proof of the last proposition, let $\mathbf{x}:=(x,\dots ,x);$ then, by Lemma 7, $\mathbf{x}\in zer\left((\Gamma \mathbf{A}+N_{\mathbf{K}})\right)$ is equivalent to

$$\begin{array}{c}\hfill \mathbf{z}=\frac{\mathrm{Id}+R_{N_{\mathbf{K}}}{R}_{\Gamma \mathbf{A}}}{2}\mathbf{z},\mathbf{x}=J_{\Gamma \mathbf{A}}\mathbf{z}.\end{array}$$

(51)

The second identity states that $x=J_{\frac{\gamma A_i}{{\omega }_i}}{z}_i,1\le i\le n$. It follows from Lemma 11 that $x={\sum }_{j=1}^n{\omega }_j{z}_j$. And, we conclude from Lemma 10 that $x\in zer\left({\sum }_{j=1}^n{A}_j\right)$. □

Therefore, although the above fixed-point methods originate from applications of generalized forward–backward methods, they intrinsically rely on bringing back the original problem to the case of $n=2$. As previously discussed, most methods can be explained as extensions of the Douglas–Rachford splitting. We remark that our work is an extension of algorithms described in Lemma 7.

4.3. Splitting Operators

In this subsection, we will design splitting operators for problem (4) with general n. It is clear from Lemma 10 that we only have to investigate the next one:

$$\begin{array}{c}\hfill \mathbf{0}\in (\Gamma \mathbf{A}+N_{\mathbf{K}})\mathbf{x}.\end{array}$$

Inspired by construction (11), we can generate a splitting operator as

$$\begin{array}{c}\hfill {\tilde{S}}_1=\left\{(\mathbf{v}+\gamma \mathbf{b},\mathbf{u}-\mathbf{v})|(\mathbf{u},\mathbf{b})\in \Gamma \mathbf{A},(\mathbf{v},\mathbf{a})\in N_{\mathbf{K}},\mathbf{v}+\gamma \mathbf{a}=\mathbf{u}-\gamma \mathbf{b}\right\}.\end{array}$$

(52)

Note that here, $\mathbf{v},\mathbf{a},\mathbf{u},\mathbf{b}\in {\mathcal{H}}^n$ and

$$\begin{array}{c}\hfill (\mathbf{v},\mathbf{a})\in N_{\mathbf{K}}\iff v_1=\dots =v_n,\sum _{j=1}^n{\omega }_i{a}_i=0,\end{array}$$

(53)

$$\begin{array}{c}\hfill (\mathbf{u},\mathbf{b})\in \Gamma \mathbf{A}\iff (u_i,b_i)\in \frac{\gamma A_i}{{\omega }_i}.\end{array}$$

(54)

Write the identity $\mathbf{v}+\gamma \mathbf{a}=\mathbf{u}-\gamma \mathbf{b}$ as $v_i+\gamma a_i=u_i-\gamma b_i.$ This, combined with identity (53), implies that

$$\begin{array}{c}\hfill v_i=\sum _{j=1}^n{\omega }_j(u_j-\gamma b_j),i=1,\dots ,n,\\ \hfill a_i=\left((u_i-\gamma b_i)-\sum _{j=1}^n{\omega }_j(u_j-\gamma b_j)\right)/\gamma .\end{array}$$

Therefore, the operator in (52) can be written equivalently as

$$\begin{array}{c}\hfill {\tilde{S}}_1=\left\{(\mathbf{p},\mathbf{q})|\begin{array}{c}\mathbf{p}={\left(p_i\right)}_{i=1}^n,\mathbf{q}={\left(q_i\right)}_{i=1}^n,\hfill \\ p_i=\sum _{j=1}^n{\omega }_j(u_j-\gamma b_j)+\gamma b_i,\hfill \\ q_i=-\sum _{j=1}^n{\omega }_j(u_j-\gamma b_j)+a_i,\hfill \\ (u_i,b_i)\in \frac{\gamma A_i}{{\omega }_i}.\hfill \end{array}\right\}\end{array}$$

(55)

With some changes in notations, we obtain the next splitting operator.

Definition 8. 

Let $A_i$ be any maximal monotone operator, and define

$$\begin{array}{c}\hfill S_1=\left\{(\mathbf{u},\mathbf{v})|\begin{array}{c}\mathbf{u}={\left(u_i\right)}_{i=1}^n,\mathbf{v}={\left(v_i\right)}_{i=1}^n,\hfill \\ u_i=\sum _{j=1}^n{\omega }_j(a_j-\frac{\gamma b_j}{{\omega }_j})+\frac{\gamma b_j}{{\omega }_j},\hfill \\ v_i=-\sum _{j=1}^n{\omega }_j(a_j-\frac{\gamma b_j}{{\omega }_j})+a_i,\hfill \\ (a_i,b_i)\in A_i.\hfill \end{array}\right\}\end{array}$$

(56)

Proposition 13. 

Let $\mathit{u}\in zer\left(S_1\right)$, then ${\sum }_{j=1}^n{\omega }_j{u}_j\in zer\left({\sum }_{j=1}^n{A}_j\right).$

Proof. 

By assumption, we have

$$\begin{array}{c}\hfill u_i=\sum _{j=1}^n{\omega }_j(a_j-\frac{\gamma b_j}{{\omega }_j})+\frac{\gamma b_j}{{\omega }_j},\end{array}$$

(57)

$$\begin{array}{c}\hfill 0=-\sum _{j=1}^n{\omega }_j(a_j-\frac{\gamma b_j}{{\omega }_j})+a_i.\end{array}$$

(58)

A weighted sum on both sides of (58) leads to

$$\begin{array}{c}\hfill \sum _{j=1}^n{b}_j=0,a_1=\dots =a_n.\end{array}$$

(59)

Let $a:=a_i,$ then, we claim that $a\in zer\left({\sum }_{j=1}^n{A}_j\right).$ Likewise, a weighted sum on both sides of (57) implies that $a={\sum }_{j=1}^n{\omega }_j{u}_j$. By (59), we have completed the proof. □

Proposition 14. 

Let Q be given in (45), then $J_{S_1}=Q$.

Proof. 

By definition, we obtain

$$\begin{array}{c}\hfill J_{S_1}={(\mathrm{Id}+S_1)}^{-1}=\left\{(\mathbf{u}+\mathbf{v},\mathbf{u})|\begin{array}{c}\mathbf{u}={\left(u_i\right)}_{i=1}^n,\mathbf{v}={\left(v_i\right)}_{i=1}^n,\hfill \\ u_i=\sum _{j=1}^n{\omega }_j(a_j-\frac{\gamma b_j}{{\omega }_j})+\frac{\gamma b_j}{{\omega }_j},\hfill \\ v_i=-\sum _{j=1}^n{\omega }_j(a_j-\frac{\gamma b_j}{{\omega }_j})+a_i,\hfill \\ (a_i,b_i)\in A_i.\hfill \end{array}\right\}\\ \hfill =\left\{(\mathbf{v},\mathbf{u})|\begin{array}{c}\mathbf{u}={\left(u_i\right)}_{i=1}^n,\mathbf{v}={\left(v_i\right)}_{i=1}^n,\hfill \\ v_i=a_i+\frac{\gamma b_j}{{\omega }_j},\hfill \\ u_i=\sum _{j=1}^n{\omega }_j(a_j-\frac{\gamma b_j}{{\omega }_j})+\frac{\gamma b_j}{{\omega }_j},\hfill \\ (a_i,b_i)\in A_i.\hfill \end{array}\right\}.\end{array}$$

(60)

It is implied from the second identity of (60) that $a_i=J_{\frac{\gamma A_i}{{\omega }_i}}\left(v_i\right)$. Substituting this into the third identity of (60), we obtain that

$$\begin{array}{c}\hfill u_i=2\sum _{j=1}^n{\omega }_j{J}_{\frac{\gamma A_j}{{\omega }_j}}\left(v_j\right)-J_{\frac{\gamma A_i}{{\omega }_i}}\left(v_i\right)-\sum _{j=1}^n{\omega }_j{v}_j+v_i,\end{array}$$

so

$$\begin{array}{c}\hfill 2u_i-v_i=2\left(2\sum _{j=1}^n{\omega }_j{J}_{\frac{\gamma A_j}{{\omega }_j}}\left(v_j\right)-J_{\frac{\gamma A_i}{{\omega }_i}}\left(v_i\right)\right)-2\sum _{j=1}^n{\omega }_j{v}_j+v_i,\end{array}$$

This is equivalent to

$$\begin{array}{c}\hfill 2\mathbf{u}-\mathbf{v}=2R_{N_{\mathbf{K}}}{J}_{\Gamma \mathbf{A}}\mathbf{v}-R_{N_{\mathbf{K}}}\mathbf{v}=\left(R_{N_{\mathbf{K}}}\left(2J_{\Gamma \mathbf{A}}\right)-R_{N_{\mathbf{K}}}\right)\mathbf{v}=R_{N_{\mathbf{K}}}{R}_{\Gamma \mathbf{A}}\mathbf{v}.\end{array}$$

Thus, we have $\mathbf{u}=(\mathbf{v}+R_{N_{\mathbf{K}}}{R}_{\Gamma \mathbf{A}}\mathbf{v})/2$, which completes this proof. □

Proposition 15. 

$S_1$ is a maximal monotone operator.

Proof. 

Assume that $(\mathbf{u},\mathbf{v}),(\tilde{\mathbf{u}},\tilde{\mathbf{v}})$ are arbitrary elements in $S_1$. That is,

$$\begin{array}{cc}\hfill \mathbf{u}=& {\left(u_i\right)}_{i=1}^n,\mathbf{v}={\left(v_i\right)}_{i=1}^n,\tilde{\mathbf{u}}={\left(\widetilde{u_i}\right)}_{i=1}^n,\tilde{\mathbf{v}}={\left(\widetilde{v_i}\right)}_{i=1}^n,\hfill \\ & u_i=\sum _{j=1}^n{\omega }_j(a_j-\frac{\gamma b_j}{{\omega }_j})+\frac{\gamma b_j}{{\omega }_j},v_i=-\sum _{j=1}^n{\omega }_j(a_j-\frac{\gamma b_j}{{\omega }_j})+a_i,(a_i,b_i)\in A_i,\hfill \\ & {\tilde{u}}_i=\sum _{j=1}^n{\omega }_j({\tilde{a}}_j-\frac{\gamma {\tilde{b}}_j}{{\omega }_j})+\frac{\gamma {\tilde{b}}_j}{{\omega }_j},{\tilde{v}}_i=-\sum _{j=1}^n{\omega }_j({\tilde{a}}_j-\frac{\gamma {\tilde{b}}_j}{{\omega }_j})+{\tilde{a}}_i,({\tilde{a}}_i,{\tilde{b}}_i)\in A_i.\hfill \end{array}$$

Let $a:={\sum }_{j=1}^n{\omega }_j({\tilde{a}}_j-a_j),b:=\gamma {\sum }_{j=1}^n({\tilde{b}}_j-b_j).$ Then

$$\begin{array}{c}\hfill {\tilde{u}}_i-u_i=a-b+\frac{\gamma }{{\omega }_i}({\tilde{b}}_i-b_i),{\tilde{v}}_i-v_i=-a+b+({\tilde{a}}_i-a_i),\end{array}$$

This implies that

$$\begin{array}{c}\hfill \langle {\tilde{v}}_i-v_i,{\tilde{u}}_i-u_i\rangle =-{\parallel a-b\parallel }^2+\frac{\gamma }{{\omega }_i}\langle b-a,{\tilde{b}}_i-b_i\rangle +\langle {\tilde{a}}_i-a_i,a-b\rangle +\frac{\gamma }{{\omega }_i}\langle {\tilde{a}}_i-a_i,{\tilde{b}}_i-b_i\rangle .\end{array}$$

Thus,

$$\begin{array}{c}\hfill \langle \tilde{\mathbf{v}}-\mathbf{v},\tilde{\mathbf{u}}-\mathbf{u}\rangle =\sum _{i=1}^n{\omega }_i\langle {\tilde{v}}_i-v_i,{\tilde{u}}_i-u_i\rangle =\gamma \sum _{i=1}^n\langle {\tilde{a}}_i-a_i,{\tilde{b}}_i-b_i\rangle \ge 0.\end{array}$$

Note that the last inequality holds due to the fact that $(a_i,b_i)\in A_i,({\tilde{a}}_i,{\tilde{b}}_i)\in A_i$ and each operator $A_i$ is monotone. Thus, we have proved that $S_1$ is a monotone operator. By Proposition 1, to prove that it is also maximal, it remains to show that $im(\mathrm{Id}+S_1)={\mathcal{H}}^n$. This is quite easy since we have proved in Proposition 14 that $J_{S_1}$ is firmly nonexpansive. □

By exchanging the two operators $\Gamma \mathbf{A}$ and $N_{\mathbf{K}}$ in (52) and applying the same methods, we obtain a splitting operator $S_2$, which possesses properties similar to $S_1$.

Definition 9. 

Let $A_i$ be any maximal monotone operator, and then define

$$\begin{array}{c}\hfill S_2=\left\{(\mathit{u},\mathit{v})|\begin{array}{c}\mathit{u}={\left(u_i\right)}_{i=1}^n,\mathit{v}={\left(v_i\right)}_{i=1}^n,\hfill \\ u_i=\sum _{j=1}^n{\omega }_j(a_j+\frac{\gamma b_j}{{\omega }_j})-\frac{\gamma b_j}{{\omega }_j},\hfill \\ v_i=\sum _{j=1}^n{\omega }_j(a_j+\frac{\gamma b_j}{{\omega }_j})-a_i,\hfill \\ (a_i,b_i)\in A_i.\hfill \end{array}\right\}\end{array}$$

Proposition 16. 

Let $\mathit{u}\in zer\left(S_2\right)$, then ${\sum }_{j=1}^n{\omega }_j{u}_j\in zer\left({\sum }_{j=1}^n{A}_j\right).$

Proposition 17. 

Let P be given in (45), then $J_{S_2}=P$.

Proposition 18. 

$S_2$ is a maximal monotone operator.

Recall that we have proved in Proposition 9 that $P,Q$ are both firmly nonexpansive. In this subsection, we propose constructive approaches to obtain maximal monotone operators $S_1$ and $S_2$ such that $Q=J_{S_1},P=J_{S_2}.$

5. Iterative Algorithms and Convergence

The main focus of this section is to present iterative schemes which produce convergent sequences leading to a solution of problem (3) or (4). Firstly, we recall three lemmas which can be used to find $Fix\left(A\right)$, the set of fixed points of an averaged nonexpansive operator A.

Lemma 12. 

Let $k\in (0,1);$ let A be a k-averaged nonexpansive operator on $\mathcal{H}$ such that $Fix\left(A\right)\ne \varnothing ,$ and let ${\left({\lambda }_n\right)}_{n\in \mathbb{N}}$ be a sequence in $[0,1/k]$ such that $\sum {\lambda }_n(1-k{\lambda }_n)=+\infty$. Set $x_0\in \mathcal{H}$, and define for $n\in \mathbb{N}$,

$$\begin{array}{c}\hfill x_{n+1}=x_n+{\lambda }_n(A{x}_n-x_n),\end{array}$$

(61)

then, ${\left(x_n\right)}_{n\in \mathbb{N}}$ converges weakly to a point in Fix(A).

Under particular circumstances, we can use Picard iteration and obtain sequences which converge to a fixed point of A.

Lemma 13. 

Let $\mathcal{H}={\mathbb{R}}^m,$ and let C be a closed and convex set of $\mathcal{H}$. If $A:C\to C$ is a k-averaged nonexpansive operator on $\mathcal{H}$ such that $k\in (0,1),Fix\left(A\right)\ne \varnothing ,$ set $x_0\in \mathcal{H}$, and define for $n\in \mathbb{N}$,

$$x_{n+1}=A{x}_n,$$

(62)

then ${\left(x_n\right)}_{n\in \mathbb{N}}$ converges weakly to a point in Fix(A).

Lemma 14. 

Let A be a k-averaged nonexpansive operator on $\mathcal{H}$ such that $k\in (0,1/2],Fix\left(A\right)\ne \varnothing ,$ set $x_0\in \mathcal{H}$, and define for $n\in \mathbb{N}$,

$$x_{n+1}=A{x}_n,$$

(63)

then ${\left(x_n\right)}_{n\in \mathbb{N}}$ converges weakly to a point in Fix(A).

Based on the above discussions, we present the following series of propositions. We remark that the corresponding iterative schemes lead to a solution of problem (3) or (4). Therefore, we have developed efficient algorithms to solve the minimization problem (1) and (2).

Proposition 19. 

Suppose we have $zer({\sum }_{j=1}^n{A}_j+B)\ne \varnothing ,$ and $\gamma >0,\beta >\frac{\gamma }{2}.$ Let ${\left({\lambda }_n\right)}_{n\in \mathbb{N}}$ be a sequence in $[0,1/k]$ such that $\sum {\lambda }_n(1-k{\lambda }_n)=+\infty$. For each $1\le i\le 4,$ set ${\mathit{x}}_0^{\left(i\right)}\in {\mathcal{H}}^n$, and define for $n\in \mathbb{N}$,

$$\begin{array}{c}\hfill {\mathit{x}}_{n+1}^{\left(i\right)}={\mathit{x}}_n^{\left(i\right)}+{\lambda }_n(T_i{\mathit{x}}_n^{\left(i\right)}-{\mathit{x}}_n^{\left(i\right)}),\end{array}$$

(64)

then, the following hold:

(i) 

For each $1\le i\le 4,$ there exists ${\mathit{z}}^{\left(i\right)}={\left(z_j^{\left(i\right)}\right)}_{j=1}^n$, such that ${\left({\mathit{x}}_n^{\left(i\right)}\right)}_{n\in \mathbb{N}}\rightharpoonup {\mathit{z}}^{\left(i\right)}$.

(ii) 

For $i=1,4,$ we have ${\sum }_{j=1}^n{\omega }_j{z}_j^{\left(i\right)}\in zer({\sum }_{j=1}^n{A}_j+B).$

(iii) 

For $i=2,3,1\le l\le n,$ we have $J_{\frac{\gamma A_l}{{\omega }_l}}(2{\sum }_{j=1}^n{\omega }_j{z}_j^{\left(i\right)}-z_l^{\left(i\right)})\in zer({\sum }_{j=1}^n{A}_j+B).$

Proof. 

This relation is due to Propositions 5 and 7 and Lemma 12. □

Similarly, Propositions 5 and 7 and Lemma 13 result in the next result.

Proposition 20. 

Suppose we have $\mathcal{H}={\mathbb{R}}^m,zer({\sum }_{j=1}^n{A}_j+B)\ne \varnothing ,$ and $\gamma >0,\beta >\frac{\gamma }{2}.$ For each $1\le i\le 4,$ set ${\mathit{x}}_0^{\left(i\right)}\in {\mathcal{H}}^n$, and define for $n\in \mathbb{N}$,

$${\mathit{x}}_{n+1}^{\left(i\right)}=T_i{\mathit{x}}_n^{\left(i\right)},$$

(65)

then, the following hold:

(i) 

For each $1\le i\le 4,$ there exists ${\mathit{z}}^{\left(i\right)}={\left(z_j^{\left(i\right)}\right)}_{j=1}^n$, such that ${\left({\mathit{x}}_n^{\left(i\right)}\right)}_{n\in \mathbb{N}}\rightharpoonup {\mathit{z}}^{\left(i\right)}$.

(ii) 

For $i=1,4,$ we have ${\sum }_{j=1}^n{\omega }_j{z}_j^{\left(i\right)}\in zer({\sum }_{j=1}^n{A}_j+B).$

(iii) 

For $i=2,3,1\le l\le n,$ we have $J_{\frac{\gamma A_l}{{\omega }_l}}(2{\sum }_{j=1}^n{\omega }_j{z}_j^{\left(i\right)}-z_l^{\left(i\right)})\in zer({\sum }_{j=1}^n{A}_j+B).$

Proposition 21. 

Suppose we have $zer\left({\sum }_{j=1}^n{A}_j\right)\ne \varnothing ,$ and $\gamma >0,\beta >\frac{\gamma }{2}.$ Set ${\mathit{x}}_0,{\mathit{y}}_0\in {\mathcal{H}}^n$, and define

$$\begin{array}{c}\hfill {\mathit{x}}_{n+1}=P{\mathit{x}}_n,{\mathit{y}}_{n+1}=Q{\mathit{y}}_n,\end{array}$$

then, the following hold:

(i) 

There exists $\mathit{x}={\left(x_j\right)}_{j=1}^n,\mathit{y}={\left(y_j\right)}_{j=1}^n\in {\mathcal{H}}^n$, such that ${\left({\mathit{x}}_n\right)}_{n\in \mathbb{N}}\rightharpoonup \mathit{x},{\left({\mathit{y}}_n\right)}_{n\in \mathbb{N}}\rightharpoonup \mathit{y}$.

(ii) 

${\sum }_{j=1}^n{\omega }_j{x}_j,{\sum }_{j=1}^n{\omega }_j{y}_j\in zer\left({\sum }_{j=1}^n{A}_j\right).$

Proof. 

This relation follows from Propositions 8 and 9 and Lemma 14. □

6. Conclusions

In this paper, we have explored iterative schemes for solving problems (3) or (4) and introduced the generalized forward–backward splitting methods along with the introduction of new operators. By introducing new operators, we were able to simplify the problems to the case of n = 2 and obtain fixed-point equations and splitting operators with desirable properties in a different way.

Our research has shown that the generalized forward–backward splitting methods are highly beneficial. Through these methods, we can generate convergent sequences that eventually lead to the solution of the problems.

Additionally, the introduction of new operators has proved to be effective in simplifying the problems and enabling a better understanding and handling of complex situations. When the zeros of the sum of n operators are reduced to the zeros of just two operators, symmetry manifests in the potential alignment of properties and patterns across the operators. If the operators possess symmetry, such as invariance under certain transformations, the zeros of these operators may exhibit similar behaviors or locations. This symmetry allows us to generalize and simplify the problem by focusing on just two representative operators.