A Parallel Inertial Proximal Optimization Method

Abstract : The Douglas-Rachford algorithm is a popular iterative method for finding a zero of a sum of two maximal monotone operators defined on a Hilbert space. In this paper, we propose an extension of this algorithm including inertia parameters and develop parallel versions to deal with the case of a sum of an arbitrary number of maximal operators. Based on this algorithm, parallel proximal algorithms are proposed to minimize over a linear subspace of a Hilbert space the sum of a finite number of proper, lower semicontinuous convex functions composed with linear operators. It is shown that particular cases of these methods are the simultaneous direction method of multipliers proposed by Stetzer et al., the parallel proximal algorithm developed by Combettes and Pesquet, and a parallelized version of an algorithm proposed by Attouch and Soueycatt.
Type de document :
Article dans une revue
Pacific journal of optimization, Yokohama Publishers, 2012, 8 (2), pp.273-305

Contributeur : Nelly Pustelnik <>
Soumis le : jeudi 21 février 2013 - 08:59:19
Dernière modification le : vendredi 5 juillet 2013 - 01:33:04


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00790702, version 1


Jean-Christophe Pesquet, Nelly Pustelnik. A Parallel Inertial Proximal Optimization Method. Pacific journal of optimization, Yokohama Publishers, 2012, 8 (2), pp.273-305. <hal-00790702>



Consultations de
la notice


Téléchargements du document