scholarly journals A Proximal Point Method Involving Two Resolvent Operators

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Oganeditse A. Boikanyo
Keyword(s):  
Hilbert Space ◽  
Proximal Point Algorithm ◽  
Maximal Monotone ◽  
Maximal Monotone Operators ◽  
Monotone Operators ◽  
Proximal Point Method ◽  
Resolvent Operators ◽  
Proximal Point ◽  
Proximal Point Algorithms ◽  
Frame Work

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.

scholarly journals A New Approximation Method for Finding Zeros of Maximal Monotone Operators

2021 ◽  
Vol 31 (2) ◽  
pp. 117-124
Keyword(s):  
Hilbert Space ◽  
Strong Convergence ◽  
Proximal Point Algorithm ◽  
Maximal Monotone ◽  
Maximal Monotone Operators ◽  
Monotone Operators ◽  
Proximal Point ◽  
Infinite Dimensional ◽  
Infinite Dimensional Hilbert Space ◽  
Dimensional Hilbert Space

One of the major problems in the theory of maximal monotone operators is to find a point in the solution set Zer( ), set of zeros of maximal monotone mapping . The problem of finding a zero of a maximal monotone in real Hilbert space has been investigated by many researchers. Rockafellar considered the proximal point algorithm and proved the weak convergence of this algorithm with the maximal monotone operator. Güler gave an example showing that Rockafellar’s proximal point algorithm does not converge strongly in an infinite-dimensional Hilbert space. In this paper, we consider an explicit method that is strong convergence in an infinite-dimensional Hilbert space and a simple variant of the hybrid steepest-descent method, introduced by Yamada. The strong convergence of this method is proved under some mild conditions. Finally, we give an application for the optimization problem and present some numerical experiments to illustrate the effectiveness of the proposed algorithm.

scholarly journals An Approximate Proximal Point Algorithm for Maximal Monotone Inclusion Problems

2011 ◽  
Vol 2011 ◽  
pp. 1-15 ◽  
Author(s):  
Lingling Huang ◽  
Sanyang Liu ◽  
Weifeng Gao
Keyword(s):  
Hilbert Spaces ◽  
Proximal Point Algorithm ◽  
Maximal Monotone ◽  
Maximal Monotone Operators ◽  
Monotone Operators ◽  
Computational Results ◽  
Monotone Inclusion ◽  
Proximal Point ◽  
Inclusion Problems ◽  
Correction Step

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.

Sign in / Sign up

Export Citation Format

Share Document