A Class of Fejér Convergent Algorithms, Approximate Resolvents and the Hybrid Proximal-Extragradient Method
- 23 October 2013
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 162 (1) , 133-153
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Outer Approximation Method for Constrained Composite Fixed Point Problems Involving Lipschitz Pseudo Contractive OperatorsNumerical Functional Analysis and Optimization, 2011
- A Monotone+Skew Splitting Model for Composite Monotone Inclusions in DualitySIAM Journal on Optimization, 2011
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic MeanSIAM Journal on Optimization, 2010
- Solving monotone inclusions via compositions of nonexpansive averaged operatorsOptimization, 2004
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS *Numerical Functional Analysis and Optimization, 2001
- A Modified Forward-Backward Splitting Method for Maximal Monotone MappingsSIAM Journal on Control and Optimization, 2000
- Full convergence of the steepest descent method with inexact line searchesOptimization, 1995
- Entropy-Like Proximal Methods in Convex ProgrammingMathematics of Operations Research, 1994
- Monotone Operators and the Proximal Point AlgorithmSIAM Journal on Control and Optimization, 1976
- Weak convergence of the sequence of successive approximations for nonexpansive mappingsBulletin of the American Mathematical Society, 1967