Have a personal or library account? Click to login
Inexact Inertial Proximal Algorithm for Maximal Monotone Operators Cover
Open Access
|Apr 2017

Abstract

In this paper, convergence of the sequence generated by the inexact form of the inertial proximal algorithm is studied. This algorithm which is obtained by the discretization of a nonlinear oscillator with damping dynamical system, has been introduced by Alvarez and Attouch (2001) and Jules and Maingé (2002) for the approximation of a zero of a maximal monotone operator. We establish weak and strong convergence results for the inexact inertial proximal algorithm with and without the summability assumption on errors, under different conditions on parameters. Our theorems extend the results on the inertial proximal algorithm established by Alvarez and Attouch (2001) and rules and Maingé (2002) as well as the results on the standard proximal point algorithm established by Brézis and Lions (1978), Lions (1978), Djafari Rouhani and Khatibzadeh (2008) and Khatibzadeh (2012). We also answer questions of Alvarez and Attouch (2001).

DOI: https://doi.org/10.1515/auom-2015-0031 | Journal eISSN: 1844-0835 | Journal ISSN: 1224-1784
Language: English
Page range: 133 - 146
Submitted on: Jan 1, 2014
Accepted on: May 1, 2014
Published on: Apr 22, 2017
Published by: Ovidius University of Constanta
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year

© 2017 Hadi Khatibzadeh, Sajad Ranjbar, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.