scholarly journals Triple Hierarchical Variational Inequalities with Constraints of Mixed Equilibria, Variational Inequalities, Convex Minimization, and Hierarchical Fixed Point Problems

2014 ◽  
Vol 2014 ◽  
pp. 1-25
Author(s):  
Lu-Chuan Ceng ◽  
Cheng-Wen Liao ◽  
Chin-Tzong Pang ◽  
Ching-Feng Wen

We introduce and analyze a hybrid iterative algorithm by virtue of Korpelevich's extragradient method, viscosity approximation method, hybrid steepest-descent method, and averaged mapping approach to the gradient-projection algorithm. It is proven that under appropriate assumptions, the proposed algorithm converges strongly to a common element of the fixed point set of infinitely many nonexpansive mappings, the solution set of finitely many generalized mixed equilibrium problems (GMEPs), the solution set of finitely many variational inequality problems (VIPs), the solution set of general system of variational inequalities (GSVI), and the set of minimizers of convex minimization problem (CMP), which is just a unique solution of a triple hierarchical variational inequality (THVI) in a real Hilbert space. In addition, we also consider the application of the proposed algorithm to solve a hierarchical fixed point problem with constraints of finitely many GMEPs, finitely many VIPs, GSVI, and CMP. The results obtained in this paper improve and extend the corresponding results announced by many others.

2012 ◽  
Vol 2012 ◽  
pp. 1-15 ◽  
Author(s):  
Yeong-Cheng Liou ◽  
Yonghong Yao ◽  
Chun-Wei Tseng ◽  
Hui-To Lin ◽  
Pei-Xia Yang

We consider a general variational inequality and fixed point problem, which is to find a pointx*with the property that (GVF):x*∈GVI(C,A)andg(x*)∈Fix(S)whereGVI(C,A)is the solution set of some variational inequalityFix(S)is the fixed points set of nonexpansive mappingS, andgis a nonlinear operator. Assume the solution setΩof (GVF) is nonempty. For solving (GVF), we suggest the following methodg(xn+1)=βg(xn)+(1-β)SPC[αnF(xn)+(1-αn)(g(xn)-λAxn)],n≥0. It is shown that the sequence{xn}converges strongly tox*∈Ωwhich is the unique solution of the variational inequality〈F(x*)-g(x*),g(x)-g(x*)〉≤0, for allx∈Ω.


Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 187
Author(s):  
Lu-Chuan Ceng ◽  
Qing Yuan

In this paper, we introduce a multiple hybrid implicit iteration method for finding a solution for a monotone variational inequality with a variational inequality constraint over the common solution set of a general system of variational inequalities, and a common fixed point problem of a countable family of uniformly Lipschitzian pseudocontractive mappings and an asymptotically nonexpansive mapping in Hilbert spaces. Strong convergence of the proposed method to the unique solution of the problem is established under some suitable assumptions.


Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1502
Author(s):  
Sun Young Cho

In a real Hilbert space, we investigate the Tseng’s extragradient algorithms with hybrid adaptive step-sizes for treating a Lipschitzian pseudomonotone variational inequality problem and a strict pseudocontraction fixed-point problem, which are symmetry. By imposing some appropriate weak assumptions on parameters, we obtain a norm solution of the problems, which solves a certain hierarchical variational inequality.


2021 ◽  
Vol 52 ◽  
Author(s):  
Maryam Yazdi

In this paper, we propose a new iterative scheme with the help of the gradient- projection algorithm (GPA) for finding a common solution of an equilibrium problem, a constrained convex minimization problem, and a fixed point problem. Then, we prove some strong convergence theorems which improve and extend some recent results. Moreover, we give a numerical result to show the validity of our main theorem.


2014 ◽  
Vol 2014 ◽  
pp. 1-22
Author(s):  
Lu-Chuan Ceng ◽  
Cheng-Wen Liao ◽  
Chin-Tzong Pang ◽  
Ching-Feng Wen

We introduce and analyze a hybrid iterative algorithm by combining Korpelevich's extragradient method, the hybrid steepest-descent method, and the averaged mapping approach to the gradient-projection algorithm. It is proven that, under appropriate assumptions, the proposed algorithm converges strongly to a common element of the fixed point set of finitely many nonexpansive mappings, the solution set of a generalized mixed equilibrium problem (GMEP), the solution set of finitely many variational inclusions, and the solution set of a convex minimization problem (CMP), which is also a unique solution of a triple hierarchical variational inequality (THVI) in a real Hilbert space. In addition, we also consider the application of the proposed algorithm to solving a hierarchical variational inequality problem with constraints of the GMEP, the CMP, and finitely many variational inclusions.


2015 ◽  
Vol 2015 ◽  
pp. 1-22
Author(s):  
L. C. Ceng ◽  
A. Latif ◽  
C. F. Wen ◽  
A. E. Al-Mazrooei

We introduce and analyze a relaxed iterative algorithm by combining Korpelevich’s extragradient method, hybrid steepest-descent method, and Mann’s iteration method. We prove that, under appropriate assumptions, the proposed algorithm converges strongly to a common element of the fixed point set of infinitely many nonexpansive mappings, the solution set of finitely many generalized mixed equilibrium problems (GMEPs), the solution set of finitely many variational inclusions, and the solution set of general system of variational inequalities (GSVI), which is just a unique solution of a triple hierarchical variational inequality (THVI) in a real Hilbert space. In addition, we also consider the application of the proposed algorithm for solving a hierarchical variational inequality problem with constraints of finitely many GMEPs, finitely many variational inclusions, and the GSVI. The results obtained in this paper improve and extend the corresponding results announced by many others.


Sign in / Sign up

Export Citation Format

Share Document