arXiv Analytics

Sign in

arXiv:1406.6257 [math.OC]AbstractReferencesReviewsResources

Forward--partial inverse--forward splitting for solving monotone inclusions

Luis M. Briceño-Arias

Published 2014-06-24Version 1

In this paper we provide a splitting method for finding a zero of the sum of a maximally monotone operator, a lipschitzian monotone operator, and a normal cone to a closed vectorial subspace of a real Hilbert space. The problem is characterized by a simpler monotone inclusion involving only two operators: the partial inverse of the maximally monotone operator with respect to the vectorial subspace and a suitable lipschitzian monotone operator. By applying the Tseng's method in this context we obtain a splitting algorithm that exploits the whole structure of the original problem and generalizes partial inverse and Tseng's methods. Connections with other methods available in the literature and applications to inclusions involving $m$ maximally monotone operators, to primal-dual composite monotone inclusions, and to zero-sum games are provided.

Related articles: Most relevant | Search more
arXiv:2305.17500 [math.OC] (Published 2023-05-27)
Forward-Half-Reflected-Partial inverse-Backward Splitting Algorithm for Solving Monotone Inclusions
arXiv:1206.5953 [math.OC] (Published 2012-06-26)
A primal-dual splitting algorithm for finding zeros of sums of maximally monotone operators
arXiv:2204.07947 [math.OC] (Published 2022-04-17)
Four-operator splitting algorithms for solving monotone inclusions