Optimization Online


Single-Forward-Step Projective Splitting: Exploiting Cocoercivity

Patrick R. Johnstone (patrick.r.johnstone***at***gmail.com)
Jonathan Eckstein (jeckstei***at***business.rutgers.edu )

Abstract: This work describes a new variant of projective splitting for monotone inclusions, in which cocoercive operators can be processed with a single forward step per iteration. This result establishes a symmetry between projective splitting algorithms, the classical forward backward splitting method (FB), and Tseng's forward-backward-forward method (FBF). Another symmetry is that the new procedure allows for larger stepsizes for cocoercive operators: the stepsize bound is $2\beta$ for a $\beta$ cocoercive operator, which is the same as for FB. To complete the connection, we show that FB corresponds to an unattainable boundary case of the parameters in the new procedure. Unlike FB, the new method allows for a backtracking procedure when the cocoercivity constant is unknown. Proving convergence of the algorithm requires some departures from the usual proof framework for projective splitting. We close with some computational tests establishing competitive performance for the method.

Keywords: proximal operator splitting, projective splitting, convex nonsmooth optimization

Category 1: Convex and Nonsmooth Optimization

Category 2: Complementarity and Variational Inequalities


Download: [PDF]

Entry Submitted: 06/19/2019
Entry Accepted: 06/19/2019
Entry Last Modified: 06/19/2019

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society