The asymptotic behavior of an inertial alternating proximal algorithm for monotone inclusions - Université des Antilles Access content directly
Journal Articles Applied Mathematics Letters Year : 2010

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.

Dates and versions

hal-00776658 , version 1 (15-01-2013)

Identifiers

Cite

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

Collections

UNIV-AG TDS-MACS
65 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More