A splitting algorithm for dual monotone inclusions involving cocoercive operators

Authors:
Bằng Công Vũ
Affiliations:
Laboratoire Jacques-Louis Lions--UMR CNRS 7598, UPMC Université Paris 06, Paris, France 75005
Venue:
Advances in Computational Mathematics
Year:
2013

Citing 10
Cited 0

Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming

Mathematical Programming: Series A and B
Applications of splitting algorithm to decomposition in convex programming and variational inequalities

SIAM Journal on Control and Optimization
A proximal-based decomposition method for convex minimization problems

Mathematical Programming: Series A and B
Co-Coercivity and Its Role In the Convergence of Iterative Schemes For Solving Variational Inequalities

SIAM Journal on Optimization
Convergence Rates in Forward--Backward Splitting

SIAM Journal on Optimization
A Parallel Splitting Method for Coupled Monotone Inclusions

SIAM Journal on Control and Optimization
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging

Journal of Mathematical Imaging and Vision
Convex Analysis and Monotone Operator Theory in Hilbert Spaces

Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective

SIAM Journal on Imaging Sciences
A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality

SIAM Journal on Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of solving dual monotone inclusions involving sums of composite parallel-sum type operators. A feature of this work is to exploit explicitly the properties of the cocoercive operators appearing in the model. Several splitting algorithms recently proposed in the literature are recovered as special cases.