Convergence of the forward-backward method for split null-point problems beyond cocoerciveness

zbMATH Open1472.65075MaRDI QIDQ5160430FDOQ5160430

Authors: Abdellatif Moudafi, Y. Shehu 

Publication date: 28 October 2021

Full work available at URL: http://yokohamapublishers.jp/online2/opjnca/vol20/p1659.html

Recommendations

• On the convergence of the forward-backward algorithm for null-point problems
• Forward-backward splitting with Bregman distances
• A generalized forward-backward splitting
• Bregman forward-backward operator splitting
• Extended forward-backward algorithm

zbMATH Keywords

maximal monotone operatorsconstrained minimization\(l_p\) normsplit null point problemdescent lemmaco-coercivenessforward-backward Bregman algorithm

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25) Monotone operators and generalizations (47H05) Variational inequalities (49J40) Programming in abstract spaces (90C48)

Cited In (10)

• A generalized forward-backward splitting
• Forward-backward splitting with Bregman distances
• Strong convergence of inertial forward–backward methods for solving monotone inclusions
• Extended forward-backward algorithm
• Convergence analysis and applications of the inertial algorithm solving inclusion problems
• Title not available (Why is that?)
• Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
• On the convergence of the forward-backward algorithm for null-point problems
• Asymptotic Convergence Analysis of the Forward-Backward Splitting Algorithm
• Bregman forward-backward operator splitting

This page was built for publication: Convergence of the forward-backward method for split null-point problems beyond cocoerciveness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5160430)