Quantitative results for a Tseng-type primal-dual method for composite monotone inclusions
本文给出了Combettes和Pesquet提出的Tseng型原始对偶分裂算法的定量结果，该算法用于求解涉及集值算子和Lipschitz算子的混合和、线性组合及并行和的单调包含问题。
Abstract We provide quantitative results on a seminal Tseng-type primal-dual splitting algorithm for solving monotone inclusions due to Combettes and Pesquet which involves a mixture of sums, linear compositions and parallel sums of set-valued and Lipschitzian operators. For that, we first give quantitative results on a version of Tseng’s forward-backward-forward splitting algorithm including error terms and variable parameters, partially extending previous work of Treusch and Kohlenbach, to which the method of Combettes and Pesquet is then reduced.