Solving monotone inclusions involving parallel sums of linearly composed maximally monotone operators

DOI10.3934/IPI.2016014zbMATH Open1348.90519arXiv1306.3191OpenAlexW2963290553MaRDI QIDQ326400FDOQ326400

Authors: Radu I. Boţ, Christopher Hendrich 

Publication date: 12 October 2016

Published in: Inverse Problems and Imaging (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1306.3191

Recommendations

• A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
• Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications
• Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
• An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
• An algorithm for splitting parallel sums of linearly composed monotone operators, with applications to signal recovery

zbMATH Keywords

convex optimizationprimal-dual algorithmmonotone inclusioninfimal convolutionFenchel dualityparallel sum

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Linear operators and ill-posed problems, regularization (47A52)

Cites Work

• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Convex analysis and monotone operator theory in Hilbert spaces
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Conjugate duality in convex optimization
• Image recovery via total variation minimization and related problems
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Title not available (Why is that?)
• Monotone Operators and the Proximal Point Algorithm
• A splitting algorithm for dual monotone inclusions involving cocoercive operators
• Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
• On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
• On the maximal monotonicity of subdifferential mappings
• A parallel splitting method for coupled monotone inclusions
• A monotone+skew splitting model for composite monotone inclusions in duality
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• A primal-dual splitting algorithm for finding zeros of sums of maximal monotone operators
• A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
• Iterative construction of the resolvent of a sum of maximal monotone operators
• Quasi-Fejérian analysis of some optimization algorithms
• Systems of Structured Monotone Inclusions: Duality, Algorithms, and Applications
• Infimal convolution regularizations with discrete \(\ell_1\)-type functionals
• Epigraphical projection for solving least squares Anscombe transformed constrained optimization problems
• A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
• A variable smoothing algorithm for solving convex optimization problems
• Duality in Vector Optimization
• On the acceleration of the double smoothing technique for unconstrained convex optimization problems
• An algorithm for splitting parallel sums of linearly composed monotone operators, with applications to signal recovery

Cited In (9)

• Preconditioned Douglas-Rachford algorithms for TV- and TGV-regularized variational imaging problems
• Almost sure convergence of the forward-backward-forward splitting algorithm
• Convergence Rate Analysis of Primal-Dual Splitting Schemes
• A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting
• A splitting algorithm for system of composite monotone inclusions
• A Tseng's type penalty scheme for solving inclusion problems involving linearly composed and parallel-sum type monotone operators
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• An algorithm for splitting parallel sums of linearly composed monotone operators, with applications to signal recovery
• Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications

This page was built for publication: Solving monotone inclusions involving parallel sums of linearly composed maximally monotone operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326400)