Generalized Eckstein-Bertsekas proximal point algorithm involving (H,η)-monotonicity framework

  • Authors:
  • Ram U. Verma

  • Affiliations:
  • Department of Mathematics, University of Central Florida, Orlando, FL 32816, USA

  • Venue:
  • Mathematical and Computer Modelling: An International Journal
  • Year:
  • 2007

Quantified Score

Hi-index 0.98

Visualization

Abstract

A general framework for the Eckstein-Bertsekas proximal point algorithm, based on the notion of (H,@h)-monotonicity, is developed. Convergence analysis for the generalized Eckstein-Bertsekas proximal point algorithm in the context of solving a class of nonlinear inclusions is examined. Furthermore, some results on general firm nonexpansiveness and resolvent mapping corresponding to (H,@h)-monotonicity are given.