Nonlinear Forward-Backward Splitting with Projection Correction
Pontus Giselsson

TL;DR
This paper introduces NOFOB, a versatile nonlinear operator splitting algorithm that generalizes existing methods and achieves convergence, including linear rates under certain conditions, expanding the toolkit for solving complex monotone operator problems.
Contribution
It proposes NOFOB, a new general nonlinear splitting algorithm that unifies and extends many existing operator splitting methods, with proven convergence and linear rates.
Findings
NOFOB generalizes multiple existing splitting methods.
The algorithm converges under broad conditions.
Linear convergence is established under metric subregularity.
Abstract
We propose and analyze a versatile and general algorithm called nonlinear forward-backward splitting (NOFOB). The algorithm consists of two steps; first an evaluation of a nonlinear forward-backward map followed by a relaxed projection onto the separating hyperplane it constructs. The key of the method is the nonlinearity in the forward-backward step, where the backward part is based on a nonlinear resolvent construction that allows for the kernel in the resolvent to be a nonlinear single-valued maximal monotone operator. This generalizes the standard resolvent as well as the Bregman resolvent, whose resolvent kernels are gradients of convex functions. This construction opens up for a new understanding of many existing operator splitting methods and paves the way for devising new algorithms. In particular, we present a four-operator splitting method as a special case of NOFOB that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
