版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Tech Univ Chemnitz Dept Math D-09107 Chemnitz Germany Univ Babes Bolyai Fac Math & Comp Sci R-3400 Cluj Napoca Romania
出 版 物:《TAIWANESE JOURNAL OF MATHEMATICS》 (Taiwanese J. Math.)
年 卷 期:2013年第17卷第6期
页 面:1983-2009页
核心收录:
基 金:DFG (German Research Foundation) [BO 2516/4-1] Romanian National Authority for Scientific Research CNCS-UEFISCDI [PN-II-ID-PCE-2011-3-0024] Collegium Talentum, Hungary POSDRU/107/1.5/S/76841
主 题:Convex minimization Coupled systems Forward-backward-forward algorithm Monotone inclusion Operator splitting
摘 要:In this paper we propose an algorithm for solving systems of coupled monotone inclusions in Hilbert spaces. The operators arising in each of the inclusions of the system are processed in each iteration separately, namely, the single-valued are evaluated explicitly (forward steps), while the, set-valued ones via their resolvents (backward steps). In addition, most of the steps in the iterative scheme can be executed simultaneously, this making the method applicable to a variety of convex minimization problems. The numerical performances of the proposed splitting algorithm are emphasized through applications in average consensus on colored networks and image classification via support vector machines.