A class of Fejer convergent algorithms, approximate resolvents and the Hybrid Proximal-Extragradient method
Author:
Preprint
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 Fejer convergent methods. We prove that such approximate resolvents are the iteration maps of the Hybrid Proximal-Extragradient method.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Solving monotone inclusions via compositions of nonexpansive averaged operatorsOptimization, 2004
- Robustness of the Hybrid Extragradient Proximal-Point AlgorithmJournal of Optimization Theory and Applications, 2001
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS *Numerical Functional Analysis and Optimization, 2001
- A Family of Enlargements of Maximal Monotone OperatorsSet-Valued Analysis, 2000
- A Hybrid Approximate Extragradient – Proximal Point Algorithm Using the Enlargement of a Maximal Monotone OperatorSet-Valued Analysis, 1999
- ε-Enlargements of Maximal Monotone Operators in Banach SpacesSet-Valued Analysis, 1999
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert spaceMathematical Programming, 1998
- Enlargement of Monotone Operators with Applications to Variational InequalitiesSet-Valued Analysis, 1997
- Full convergence of the steepest descent method with inexact line searchesOptimization, 1995
- Monotone Operators and the Proximal Point AlgorithmSIAM Journal on Control and Optimization, 1976