Finding the Forward-Douglas-Rachford-Forward Method

被引:42
|
作者
Ryu, Ernest K. [1 ]
Bang Cong Vu [2 ]
机构
[1] Univ Calif Los Angeles, Los Angeles, CA 90095 USA
[2] Vietnam Natl Univ, Dept Math, Hanoi, Vietnam
关键词
Douglas-Rachford; Forward-backward-forward; Forward-reflected-backward; Monotone inclusion; MONOTONE-OPERATORS; ALGORITHM; SUM; CONVERGENCE; PERFORMANCE;
D O I
10.1007/s10957-019-01601-z
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider the monotone inclusion problem with a sum of 3 operators, in which 2 are monotone and 1 is monotone-Lipschitz. The classical Douglas-Rachford and forward-backward-forward methods, respectively, solve the monotone inclusion problem with a sum of 2 monotone operators and a sum of 1 monotone and 1 monotone-Lipschitz operators. We first present a method that naturally combines Douglas-Rachford and forward-backward-forward and show that it solves the 3-operator problem under further assumptions, but fails in general. We then present a method that naturally combines Douglas-Rachford and forward-reflected-backward, a recently proposed alternative to forward-backward-forward by Malitsky and Tam (A forward-backward splitting method for monotone inclusions without cocoercivity, 2018. ). We show that this second method solves the 3-operator problem generally, without further assumptions.
引用
收藏
页码:858 / 876
页数:19
相关论文
共 50 条