scholarly journals Composite inertial subgradient extragradient methods for variational inequalities and fixed point problems

Author(s):  
Lu-Chuan Ceng ◽  
Qing Yuan

Abstract In this paper, we introduce and investigate composite inertial gradient-based algorithms with a line-search process for solving a variational inequality problem (VIP) with a pseudomonotone and Lipschitz continuous mapping and a common fixed-point problem (CFPP) of finitely many nonexpansive mappings and a strictly pseudocontractive mapping in the framework infinite-dimensional Hilbert spaces. The proposed algorithms are based on an inertial subgradient–extragradient method with the line-search process, hybrid steepest-descent methods, viscosity approximation methods and Mann iteration methods. Under weak conditions, we prove strong convergence of the proposed algorithms to the element in the common solution set of the VIP and CFPP, which solves a certain hierarchical VIP defined on this common solution set.

Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 881 ◽  
Author(s):  
Lu-Chuan Ceng ◽  
Xiaolong Qin ◽  
Yekini Shehu ◽  
Jen-Chih Yao

In a real Hilbert space, let the notation VIP indicate a variational inequality problem for a Lipschitzian, pseudomonotone operator, and let CFPP denote a common fixed-point problem of an asymptotically nonexpansive mapping and finitely many nonexpansive mappings. This paper introduces mildly inertial algorithms with linesearch process for finding a common solution of the VIP and the CFPP by using a subgradient approach. These fully absorb hybrid steepest-descent ideas, viscosity iteration ideas, and composite Mann-type iterative ideas. With suitable conditions on real parameters, it is shown that the sequences generated our algorithms converge to a common solution in norm, which is a unique solution of a hierarchical variational inequality (HVI).


Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 925 ◽  
Author(s):  
Lu-Chuan Ceng ◽  
Adrian Petruşel ◽  
Jen-Chih Yao

In a real Hilbert space, we denote CFPP and VIP as common fixed point problem of finitely many strict pseudocontractions and a variational inequality problem for Lipschitzian, pseudomonotone operator, respectively. This paper is devoted to explore how to find a common solution of the CFPP and VIP. To this end, we propose Mann viscosity algorithms with line-search process by virtue of subgradient extragradient techniques. The designed algorithms fully assimilate Mann approximation approach, viscosity iteration algorithm and inertial subgradient extragradient technique with line-search process. Under suitable assumptions, it is proven that the sequences generated by the designed algorithms converge strongly to a common solution of the CFPP and VIP, which is the unique solution to a hierarchical variational inequality (HVI).


Mathematics ◽  
2021 ◽  
Vol 9 (24) ◽  
pp. 3322
Author(s):  
Lu-Chuan Ceng ◽  
Jen-Chih Yao ◽  
Yekini Shehu

We propose two Mann-type subgradient-like extra gradient iterations with the line-search procedure for hierarchical variational inequality (HVI) with the common fixed-point problem (CFPP) constraint of finite family of nonexpansive mappings and an asymptotically nonexpansive mapping in a real Hilbert space. Our methods include combinations of the Mann iteration method, subgradient extra gradient method with the line-search process, and viscosity approximation method. Under suitable assumptions, we obtain the strong convergence results of sequence of iterates generated by our methods for a solution to HVI with the CFPP constraint.


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.


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.


2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Long He ◽  
Yun-Ling Cui ◽  
Lu-Chuan Ceng ◽  
Tu-Yan Zhao ◽  
Dan-Qiong Wang ◽  
...  

AbstractIn a real Hilbert space, let GSVI and CFPP represent a general system of variational inequalities and a common fixed point problem of a countable family of nonexpansive mappings and an asymptotically nonexpansive mapping, respectively. In this paper, via a new subgradient extragradient implicit rule, we introduce and analyze two iterative algorithms for solving the monotone bilevel equilibrium problem (MBEP) with the GSVI and CFPP constraints, i.e., a strongly monotone equilibrium problem over the common solution set of another monotone equilibrium problem, the GSVI and the CFPP. Some strong convergence results for the proposed algorithms are established under the mild assumptions, and they are also applied for finding a common solution of the GSVI, VIP, and FPP, where the VIP and FPP stand for a variational inequality problem and a fixed point problem, respectively.


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.


2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
M. Dilshad ◽  
A. F. Aljohani ◽  
M. Akram

This article is aimed at introducing an iterative scheme to approximate the common solution of split variational inclusion and a fixed-point problem of a finite collection of nonexpansive mappings. It is proven that under some suitable assumptions, the sequences achieved by the proposed iterative scheme converge strongly to a common element of the solution sets of these problems. Some consequences of the main theorem are also given. Finally, the convergence analysis of the sequences achieved from the iterative scheme is illustrated with the help of a numerical example.


2014 ◽  
Vol 2014 ◽  
pp. 1-18
Author(s):  
Lu-Chuan Ceng ◽  
Saleh A. Al-Mezel ◽  
Abdul Latif

The purpose of this paper is to introduce and analyze hybrid viscosity methods for a general system of variational inequalities (GSVI) with hierarchical fixed point problem constraint in the setting of real uniformly convex and 2-uniformly smooth Banach spaces. Here, the hybrid viscosity methods are based on Korpelevich’s extragradient method, viscosity approximation method, and hybrid steepest-descent method. We propose and consider hybrid implicit and explicit viscosity iterative algorithms for solving the GSVI with hierarchical fixed point problem constraint not only for a nonexpansive mapping but also for a countable family of nonexpansive mappings inX, respectively. We derive some strong convergence theorems under appropriate conditions. Our results extend, improve, supplement, and develop the recent results announced by many authors.


Sign in / Sign up

Export Citation Format

Share Document