The asymptotic behavior of an inertial alternating proximal algorithm for monotone inclusions

Abstract : The aim of this paper is to investigate the asymptotic behavior of an inertial alternating algorithm based on the composition of resolvents of monotone operators. The proposed algorithm is a generalization of those proposed in Attouch et al. (2007) and Bauschke et al. (2005). As a special case, we also recover the classical alternating minimization algorithm (Acker, 1980), which itself is a natural extension of the alternating projection algorithm of von Neumann (1950) [4]. An application to equilibrium problems is also proposed.
Document type :
Journal articles
Complete list of metadatas

https://hal.univ-antilles.fr/hal-00776658
Contributor : Pamphile Isch <>
Submitted on : Tuesday, January 15, 2013 - 9:44:25 PM
Last modification on : Wednesday, July 18, 2018 - 8:11:27 PM

Links full text

Identifiers

Collections

Citation

Abdellatif Moudafi. The asymptotic behavior of an inertial alternating proximal algorithm for monotone inclusions. Applied Mathematics Letters, Elsevier, 2010, 23 (5), pp.620-624. ⟨10.1016/j.aml.2010.01.023⟩. ⟨hal-00776658⟩

Share

Metrics

Record views

135