scholarly journals Iterative approximations with hybrid techniques for fixed points and equilibrium problems

Filomat ◽  
2016 ◽  
Vol 30 (7) ◽  
pp. 1997-2009
Author(s):  
Afrah Abdou ◽  
Badriah Alamri ◽  
Yeol Cho ◽  
Li-Jun Zhu

In this paper, we consider an iterative algorithm by using the shrinking projection method for solving the fixed point problem of the pseudo-contractive mappings and the generalized equilibrium problems. We prove some lemmas for our main result and a strong convergence theorem for the proposed algorithm.

Author(s):  
Xueling Zhou ◽  
Meixia Li ◽  
Haitao Che

In this paper, we study the split equality fixed point problem and propose a new iterative algorithm with a self-adaptive stepsize that does not need the prior information of the operator norms and is calculated easily. The L-Lipschitz and quasi-pseudo-contractive mappings are chosen as the operators in the algorithm since they have a wider range of applications. Moreover, we prove that the sequence generated by the algorithm strongly converges to the solution of the problem. Finally, we check the feasibility and effectiveness of the algorithm by comparing with other algorithms.


Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1161
Author(s):  
Jinhua Zhu ◽  
Jinfang Tang ◽  
Shih-sen Chang ◽  
Min Liu ◽  
Liangcai Zhao

In this paper, we introduce an iterative algorithm for finding a common solution of a finite family of the equilibrium problems, quasi-variational inclusion problems and fixed point problem on Hadamard manifolds. Under suitable conditions, some strong convergence theorems are proved. Our results extend some recent results in literature.


2018 ◽  
Vol 24 (1) ◽  
pp. 1-19 ◽  
Author(s):  
Dang Van Hieu

The paper considers the problem of finding a common solution of a pseudomonotone and Lipschitz-type equilibrium problem and a fixed point problem for a quasi nonexpansive mapping in a Hilbert space. A new hybrid algorithm is introduced for approximating a solution of this problem. The presented algorithm can be considered as a combination of the extragradient method (two-step proximal-like method) and a modified version of the normal Mann iteration. It is well known that the normal Mann iteration has the weak convergence, but in this paper we has obtained the strong convergence of the new algorithm under some mild conditions on parameters. Several numerical experiments are reported to illustrate the convergence of the algorithm and also to show the advantages of it over existing methods.


Sign in / Sign up

Export Citation Format

Share Document