Wed.1 11:30–12:45 | H 1028 | CNV
.

New Frontiers in Splitting Algorithms for Optimization and Monotone Inclusions (1/3)

Chair: Patrick L. Combettes Organizer: Patrick L. Combettes
11:30

Bang Cong Vu

A splitting method for three operators involving Lipschitzian operators

We investigate the problem of finding a zero point of the sum of 3 operators where one of them is monotone Lipschitzian. We propose a new splitting method for solving this inclusion in real Hilbert spaces. The proposed framework unifies several splitting method existing in the literature. The weak convergence of the iterates is proved. The strong convergence is also obtained under an additional assumptions. Applications to sums of composite monotone inclusions and composite minimization problems are demonstrated.

11:55

Saverio Salzo

Parallel random block-coordinate forward-backward algorithm: A complete convergence analysis

We study the block coordinate forward-backward algorithm where the blocks are updated in a random and possibly parallel manner. We consider the convex case and provide a unifying analysis of the convergence under different hypotheses, advancing the state of the art in several aspects.

12:20

Patrick L. Combettes

joint work with Minh N. Bui

A general Bregman-based splitting scheme for monotone inclusions

We present a unifying framework for solving monotone inclusions in general Banach spaces using Bregman distances. This is achieved by introducing a new property that includes in particular the standard cocoercivity property. Several classical and recent algorithms are featured as special cases of our framework. The results are new even in standard Euclidean spaces. Applications are discussed as well.