Loading…

Solving monotone inclusions involving the sum of three maximally monotone operators and a cocoercive operator with applications

In this paper, we propose two four-operator splitting algorithms for approaching the set of zeros of the sum of three maximally monotone operators and a cocoercive operator. Our methods do not rely on the traditional product space technique. The sequences of the proposed algorithms are proven to be...

Full description

Saved in:
Bibliographic Details
Published in:Set-valued and variational analysis 2023-06, Vol.31 (2), Article 16
Main Authors: Zong, Chunxiang, Tang, Yuchao, Zhang, Guofeng
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we propose two four-operator splitting algorithms for approaching the set of zeros of the sum of three maximally monotone operators and a cocoercive operator. Our methods do not rely on the traditional product space technique. The sequences of the proposed algorithms are proven to be convergent under mild conditions. In applications of interest to us, we employ the proposed algorithms to solve a composite convex minimization problem, for which we also provide convergence analysis. Numerical experiments are performed on the image inpainting problem to demonstrate the efficiency of the proposed algorithms.
ISSN:1877-0533
1877-0541
DOI:10.1007/s11228-023-00677-0