Work

Quantitative results for a Tseng-type primal-dual method for composite monotone inclusions

Year: 2025

Type: article

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.

Source: Computational Optimization and Applications

DOI: 10.1007/s10589-025-00744-2

Authors: Ulrich Kohlenbach, Nicholas Pischke

Institution: Technische Universität Darmstadt

Language: English

Topic: Optimization and Variational Analysis

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,190

Funder: Technische Universität Darmstadt