We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Parallel, Block-Iterative, Primal-Dual Monotone Operator Splitting

Formal Metadata

Title
Parallel, Block-Iterative, Primal-Dual Monotone Operator Splitting
Title of Series
Number of Parts
30
Author
Contributors
License
CC Attribution - NonCommercial - NoDerivatives 4.0 International:
You are free to use, copy, distribute and transmit the work or content in unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. At each iteration, only a subset of the monotone operators needs to be processed, as opposed to all operators as in established methods. Deterministic strategies are used to select the blocks of operators activated at each iteration. In addition, asynchronous implementation is allowed. The first method provides weakly convergent primal and dual sequences under general conditions, while the second is a variant in which strong convergence is guaranteed without additional assumptions. The novelty of this class of algorithms will be discussed and comparisons with the state of the art will be performed.