SOLVING MONOTONE INCLUSIONS INVOLVING PARALLEL SUMS OF LINEARLY COMPOSED MAXIMALLY MONOTONE OPERATORS

被引:4
|
作者
Bot, Radu Ioan [1 ]
Hendrich, Christopher [2 ]
机构
[1] Univ Vienna, Fac Math, Oskar Morgenstern Pl 1, A-1090 Vienna, Austria
[2] Tech Univ Chemnitz, Dept Math, D-09107 Chemnitz, Germany
关键词
Convex optimization; Fenchel duality; infimal convolution; monotone inclusion; parallel sum; primal-dual algorithm; SPLITTING METHOD; ALGORITHM;
D O I
10.3934/ipi.2016014
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页码:617 / 640
页数:24
相关论文
共 50 条