scholarly journals Modified inertial algorithm for solving mixed equilibrium problems in Hadamard spaces

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Abdul Rahim Khan ◽  
Chinedu Izuchukwu ◽  
Maggie Aphane ◽  
Godwin Chidi Ugwunnadi

<p style='text-indent:20px;'>The main purpose of this paper is to introduce the concept of modified inertial algorithm in Hadamard spaces. We emphasize that, as far as we know, this is the first time that this concept is being considered in this setting. Under some weak assumptions, we prove that the modified inertial algorithm converges strongly to a common solution of a finite family of mixed equilibrium problems and fixed point problem of a nonexpansive mapping. We also give a primary numerical illustration in the framework of Hadamard spaces, to show the efficiency of the modified inertial term in our proposed algorithm.</p>

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.


Author(s):  
K. O. Aremu ◽  
C. Izuchukwu ◽  
A. A. Mebawondu ◽  
O. T. Mewomo

In this paper, we introduce a viscosity-type proximal point algorithm comprising of a finite composition of resolvents of monotone bifunctions and a generalized asymptotically nonspreading mapping recently introduced by Phuengrattana [Appl. Gen. Topol. 18 (2017) 117–129]. We establish a strong convergence result of the proposed algorithm to a common solution of a finite family of equilibrium problems and fixed point problem for a generalized asymptotically nonspreading and nonexpansive mappings, which is also a unique solution of some variational inequality problems in an Hadamard space. We apply our result to solve convex feasibility problem and to approximate a common solution of a finite family of minimization problems in an Hadamard space.


2014 ◽  
Vol 2014 ◽  
pp. 1-17
Author(s):  
Poom Kumam ◽  
Thanyarat Jitpeera

We introduce a new iterative algorithm for approximating a common element of the set of solutions for mixed equilibrium problems, the set of solutions of a system of quasi-variational inclusion, and the set of fixed points of an infinite family of nonexpansive mappings in a real Hilbert space. Strong convergence of the proposed iterative algorithm is obtained. Our results generalize, extend, and improve the results of Peng and Yao, 2009, Qin et al. 2010 and many authors.


Mathematics ◽  
2019 ◽  
Vol 7 (3) ◽  
pp. 255
Author(s):  
Yan Tang ◽  
Yeol Cho

In this paper, the split variational inclusion problem (SVIP) and the system of equilibrium problems (EP) are considered in Hilbert spaces. Inspired by the works of Byrne et al., López et al., Moudafi and Thukur, Sobumt and Plubtieng, Sitthithakerngkiet et al. and Eslamian and Fakhri, a new self-adaptive step size algorithm is proposed to find a common element of the solution set of the problems SVIP and EP. Convergence theorems are established under suitable conditions for the algorithm and application to the common solution of the fixed point problem, and the split convex optimization problem is considered. Finally, the performances and computational experiments are presented and a comparison with the related algorithms is provided to illustrate the efficiency and applicability of our new algorithms.


2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Yasir Arfat ◽  
Poom Kumam ◽  
Parinya Sa Ngiamsunthorn ◽  
Muhammad Aqeel Ahmad Khan ◽  
Hammad Sarwar ◽  
...  

Abstract In this paper, we study a modified extragradient method for computing a common solution to the split equilibrium problem and fixed point problem of a nonexpansive semigroup in real Hilbert spaces. The weak and strong convergence characteristics of the proposed algorithm are investigated by employing suitable control conditions in such a setting of spaces. As a consequence, we provide a simplified analysis of various existing results concerning the extragradient method in the current literature. We also provide a numerical example to strengthen the theoretical results and the applicability of the proposed algorithm.


Author(s):  
C. Izuchukwu ◽  
F. O. Isiogugu ◽  
C. C. Okeke

Abstract In this paper, we introduce a new viscosity-type iteration process for approximating a common solution of a finite family of split variational inclusion problem and fixed point problem. We prove that the proposed algorithm converges strongly to a common solution of a finite family of split variational inclusion problems and fixed point problem for a finite family of type-one demicontractive mappings between a Hilbert space and a Banach space. Furthermore, we applied our results to study a finite family of split convex minimization problems, and also considered a numerical experiment of our results to further illustrate its applicability. Our results extend and improve the results of Byrne et al. (J. Nonlinear Convex Anal. 13:759–775, 2012), Kazmi and Rizvi (Optim. Lett. 8(3):1113–1124, 2014), Moudafi (J. Optim. Theory Appl. 150:275–283, 2011), Shehu and Ogbuisi (Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat. 110(2):503–518, 2016), Takahashi and Yao (Fixed Point Theory Appl. 2015:87, 2015), Chidume and Ezeora (Fixed Point Theory Appl. 2014:111, 2014), and a host of other important results in this direction.


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