Solving monotone inclusions involving parallel sums of linearly composed maximally monotone operators
Open Access
- 1 January 2016
- journal article
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 10 (3) , 617-640
Abstract
The aim of this article is to present two different primal-dual methods for solving structured monotone inclusions involving parallel sums of compositions of maximally monotone operators with linear bounded operators. By employing some elaborated splitting techniques, all of the operators occurring in the problem formulation are processed individually via forward or backward steps. The treatment of parallel sums of linearly composed maximally monotone operators is motivated by applications in imaging which involve first- and second-order total variation functionals, to which a special attention is given.Keywords
All Related Versions
This publication has 28 references indexed in Scilit:
- A variable smoothing algorithm for solving convex optimization problemsTOP, 2014
- On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problemsMathematical Programming, 2014
- Convergence Analysis for a Primal-Dual Monotone + Skew Splitting Algorithm with Applications to Total Variation MinimizationJournal of Mathematical Imaging and Vision, 2014
- A Primal-Dual Splitting Algorithm for Finding Zeros of Sums of Maximal Monotone OperatorsSIAM Journal on Optimization, 2013
- On the acceleration of the double smoothing technique for unconstrained convex optimization problemsOptimization, 2012
- A double smoothing technique for solving unconstrained nondifferentiable convex optimization problemsComputational Optimization and Applications, 2012
- Convex Analysis and Monotone Operator Theory in Hilbert Spaces2011
- Conjugate Duality in Convex Optimization2010
- A Parallel Splitting Method for Coupled Monotone InclusionsSIAM Journal on Control and Optimization, 2010
- Duality in Vector Optimization2009