Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators

Abstract : We propose a primal-dual splitting algorithm for solving monotone inclusions involving a mixture of sums, linear compositions, and parallel sums of set-valued and Lipschitzian operators. An important feature of the algorithm is that the Lipschitzian operators present in the formulation can be processed individually via explicit steps, while the set-valued operators are processed individually via their resolvents. In addition, the algorithm is highly parallel in that most of its steps can be executed simultaneously. This work brings together and notably extends various types of structured monotone inclusion problems and their solution methods. The application to convex minimization problems is given special attention.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [40 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00794044
Contributor : Jean-Christophe Pesquet <>
Submitted on : Monday, February 25, 2013 - 11:58:18 AM
Last modification on : Thursday, April 4, 2019 - 1:16:43 AM
Document(s) archivé(s) le : Sunday, May 26, 2013 - 4:10:08 AM

File

svva2.pdf
Files produced by the author(s)

Identifiers

Citation

Patrick Louis Combettes, Jean-Christophe Pesquet. Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators. Set-Valued and Variational Analysis, Springer, 2012, 20 (2), pp.307-330. 〈10.1007/s11228-011-0191-y〉. 〈hal-00794044〉

Share

Metrics

Record views

539

Files downloads

161