Primal-Dual Splitting Algorithms for Solving Structured Monotone Inclusion with Applications

This work proposes two different primal-dual splitting algorithms for solving structured monotone inclusion containing a cocoercive operator and the parallel-sum of maximally monotone operators. In particular, the parallel-sum is symmetry. The proposed primal-dual splitting algorithms are derived from two approaches: One is the preconditioned forward–backward splitting algorithm, and the other is the forward–backward–half-forward splitting algorithm. Both algorithms have a simple calculation framework. In particular, the single-valued operators are processed via explicit steps, while the set-valued operators are computed by their resolvents. Numerical experiments on constrained image denoising problems are presented to show the performance of the proposed algorithms.

TRIPLET INVARIANCE AND PARALLEL SUMS

Let R be a semiprime ring with extended centroid C and let $I(x)$ denote the set of all inner inverses of a regular element x in R. Given two regular elements $a, b$ in R, we characterise the existence of some $c\in R$ such that $I(a)+I(b)=I(c)$ . Precisely, if $a, b, a+b$ are regular elements of R and a and b are parallel summable with the parallel sum ${\cal P}(a, b)$ , then $I(a)+I(b)=I({\cal P}(a, b))$ . Conversely, if $I(a)+I(b)=I(c)$ for some $c\in R$ , then $\mathrm {E}[c]a(a+b)^{-}b$ is invariant for all $(a+b)^{-}\in I(a+b)$ , where $\mathrm {E}[c]$ is the smallest idempotent in C satisfying $c=\mathrm {E}[c]c$ . This extends earlier work of Mitra and Odell for matrix rings over a field and Hartwig for prime regular rings with unity and some recent results proved by Alahmadi et al. [‘Invariance and parallel sums’, Bull. Math. Sci.10(1) (2020), 2050001, 8 pages] concerning the parallel summability of unital prime rings and abelian regular rings.