scholarly journals An Extragradient Method and Proximal Point Algorithm for Inverse Strongly Monotone Operators and Maximal Monotone Operators in Banach Spaces

2009 ◽  
Vol 2009 (1) ◽  
pp. 591874 ◽  
Author(s):  
Somyot Plubtieng ◽  
Wanna Sriprad
2011 ◽  
Vol 2011 ◽  
pp. 1-31 ◽  
Author(s):  
Kriengsak Wattanawitoon ◽  
Poom Kumam

We prove strong and weak convergence theorems of modified hybrid proximal-point algorithms for finding a common element of the zero point of a maximal monotone operator, the set of solutions of equilibrium problems, and the set of solution of the variational inequality operators of an inverse strongly monotone in a Banach space under different conditions. Moreover, applications to complementarity problems are given. Our results modify and improve the recently announced ones by Li and Song (2008) and many authors.


2011 ◽  
Vol 2011 ◽  
pp. 1-15 ◽  
Author(s):  
Lingling Huang ◽  
Sanyang Liu ◽  
Weifeng Gao

This paper presents and analyzes a strongly convergent approximate proximal point algorithm for finding zeros of maximal monotone operators in Hilbert spaces. The proposed method combines the proximal subproblem with a more general correction step which takes advantage of more information on the existing iterations. As applications, convex programming problems and generalized variational inequalities are considered. Some preliminary computational results are reported.


2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Oganeditse A. Boikanyo

We construct a sequence of proximal iterates that converges strongly (under minimal assumptions) to a common zero of two maximal monotone operators in a Hilbert space. The algorithm introduced in this paper puts together several proximal point algorithms under one frame work. Therefore, the results presented here generalize and improve many results related to the proximal point algorithm which were announced recently in the literature.


Sign in / Sign up

Export Citation Format

Share Document