pith. sign in

arxiv: 1807.04871 · v2 · pith:RA3LCDHNnew · submitted 2018-07-13 · 🧮 math.OC

Bregman Monotone Operator Splitting

classification 🧮 math.OC
keywords splittingbregmanmonotoneoperatorb-mosconvergencedivergencealgorithms
0
0 comments X p. Extension
pith:RA3LCDHN Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{RA3LCDHN}

Prints a linked pith:RA3LCDHN badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

Monotone operator splitting is a powerful paradigm that facilitates parallel processing for optimization problems where the cost function can be split into two convex functions. We propose a generalized form of monotone operator splitting based on Bregman divergence. We show that an appropriate design of the Bregman divergence leads to faster convergence than conventional splitting algorithms. The proposed Bregman monotone operator splitting (B-MOS) is applied to an application to illustrate its effectiveness. B-MOS was found to significantly improve the convergence rate.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.