scholarly journals A Hybrid Proximal Algorithm for the Sum of Monotone Operators with Multivalued Mappings

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
N. Kaewyong ◽  
L. Kittiratanawasin ◽  
C. Pukdeboon ◽  
K. Sitthithakerngkiet

We modify a hybrid method and a proximal point algorithm to iteratively find a zero point of the sum of two monotone operators and fixed point of nonspreading multivalued mappings in a Hilbert space by using the technique of forward-backward splitting method. The strong convergence theorem is established and the illustrative numerical example is presented on this work. The results of this paper extend and improve some well-known results in the literature.

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.


Author(s):  
Ulrich Kohlenbach

AbstractIn a recent paper, Bauschke et al. study $$\rho $$ ρ -comonotonicity as a generalized notion of monotonicity of set-valued operators A in Hilbert space and characterize this condition on A in terms of the averagedness of its resolvent $$J_A.$$ J A . In this note we show that this result makes it possible to adapt many proofs of properties of the proximal point algorithm PPA and its strongly convergent Halpern-type variant HPPA to this more general class of operators. This also applies to quantitative results on the rates of convergence or metastability (in the sense of T. Tao). E.g. using this approach we get a simple proof for the convergence of the PPA in the boundedly compact case for $$\rho $$ ρ -comonotone operators and obtain an effective rate of metastability. If A has a modulus of regularity w.r.t. $$zer\, A$$ z e r A we also get a rate of convergence to some zero of A even without any compactness assumption. We also study a Halpern-type variant HPPA of the PPA for $$\rho $$ ρ -comonotone operators, prove its strong convergence (without any compactness or regularity assumption) and give a rate of metastability.


2020 ◽  
Vol 53 (1) ◽  
pp. 95-111 ◽  
Author(s):  
Grace N. Ogwo ◽  
Chinedu Izuchukwu ◽  
Kazeem O. Aremu ◽  
Oluwatosin T. Mewomo

AbstractOur main interest in this article is to introduce and study the class of θ-generalized demimetric mappings in Hadamard spaces. Also, a Halpern-type proximal point algorithm comprising this class of mappings and resolvents of monotone operators is proposed, and we prove that it converges strongly to a fixed point of a θ-generalized demimetric mapping and a common zero of a finite family of monotone operators in a Hadamard space. Furthermore, we apply the obtained results to solve a finite family of convex minimization problems, variational inequality problems and convex feasibility problems in Hadamard spaces.


2021 ◽  
Vol 31 (2) ◽  
pp. 117-124

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.


2015 ◽  
Vol 23 (2) ◽  
pp. 133-146
Author(s):  
Hadi Khatibzadeh ◽  
Sajad Ranjbar

Abstract In this paper, convergence of the sequence generated by the inexact form of the inertial proximal algorithm is studied. This algorithm which is obtained by the discretization of a nonlinear oscillator with damping dynamical system, has been introduced by Alvarez and Attouch (2001) and Jules and Maingé (2002) for the approximation of a zero of a maximal monotone operator. We establish weak and strong convergence results for the inexact inertial proximal algorithm with and without the summability assumption on errors, under different conditions on parameters. Our theorems extend the results on the inertial proximal algorithm established by Alvarez and Attouch (2001) and rules and Maingé (2002) as well as the results on the standard proximal point algorithm established by Brézis and Lions (1978), Lions (1978), Djafari Rouhani and Khatibzadeh (2008) and Khatibzadeh (2012). We also answer questions of Alvarez and Attouch (2001).


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.


Sign in / Sign up

Export Citation Format

Share Document