Optimization Online


A class of Fejer convergent algorithms, approximate resolvents and the Hybrid Proximal-Extragradient method

B. F. Svaiter (benar***at***impa.br)

Abstract: A new framework for analyzing Fejer convergent algorithms is presented. Using this framework we define a very general class of Fejer convergent algorithms and establish its convergence properties. We also introduce a new definition of approximations of resolvents which preserve some useful features of the exact resolvent, and use this concept to present an unifying view of the Forward-Backward splitting method, Tseng's Modified Forward-Backward splitting method and Korpelevich's method. We show that methods based on families of approximate resolvents fall within the aforementioned class of Fej'er convergent methods. We prove that such approximate resolvents are the iteration maps of the Hybrid Proximal-Extragradient method.

Keywords: Fejer convergence; approximate resolvent; hybrid proximal-extragradient

Category 1: Complementarity and Variational Inequalities

Category 2: Infinite Dimensional Optimization

Category 3: Nonlinear Optimization

Citation: IMPA Preprint serie A 715/2012

Download: [PDF]

Entry Submitted: 04/05/2012
Entry Accepted: 04/05/2012
Entry Last Modified: 04/18/2012

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society