Vol. 21(2020) No. 2

 

 

  A three-operator splitting algorithm for null-point problems
 
Home
Volumes Selection

Fixed Point Theory, Volume 21, No. 2, 2020, 685-692, July 1st, 2020

DOI: 10.24193/fpt-ro.2020.2.47

Authors: Abdellatif Moudafi

Abstract: The aim of this paper is to present and investigate the asymptotic behavior of a novel splitting algorithm for solving a class of null-point problems governed by three maximal monotone operators. Two of which are assumed to be proximable and one verified a cocoercive property. The proposed algorithm is based on a duality principle and the convergence proofs rely on classical arguments of nonlinear analysis and properties of the resolvent mappings of maximal monotone operators. The convex optimization case is also addressed with its related algorithm and convergence result.

Key Words and Phrases: Maximal monotone operators, splitting algorithms, Yosida approximate operator, cocoercivity, strong monotonicity, convex minimization, conjugate function.

2010 Mathematics Subject Classification: 49J53, 65K10, 49M37, 47H10, 90C25.

Published on-line: July 1st, 2020.

Abstract pdf          Fulltext pdf

Back to volume's table of contents


Home | Indexing-Abstracting | Aims and Scope | Editors | Editorial Board | Published Volumes | Instructions for authors | Subscription | Reviewers Ackn. | Secretaries | FPT Conferences | FPT Book Review