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

From MaRDI portal
Publication:452270

DOI10.1007/S11228-011-0191-YzbMATH Open1284.47043arXiv1107.0081OpenAlexW2007437458MaRDI QIDQ452270FDOQ452270


Authors: Patrick L. Combettes, Jean-Christophe Pesquet Edit this on Wikidata


Publication date: 20 September 2012

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1107.0081




Recommendations




Cites Work


Cited In (only showing first 100 items - show all)





This page was built for publication: Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452270)