scholarly journals General Iterative Algorithms for Hierarchical Fixed Points Approach to Variational Inequalities

2012 ◽  
Vol 2012 ◽  
pp. 1-20
Author(s):  
Nopparat Wairojjana ◽  
Poom Kumam
Keyword(s):  
Hilbert Space ◽  
Fixed Point ◽  
Variational Inequality ◽  
Bounded Operator ◽  
Iterative Algorithms ◽  
Metric Projection ◽  
Fixed Point Problem ◽  
Point Problem ◽  
Linear Bounded Operator ◽  
New Methods

This paper deals with new methods for approximating a solution to the fixed point problem; findx̃∈F(T), whereHis a Hilbert space,Cis a closed convex subset ofH,fis aρ-contraction fromCintoH,0<ρ<1,Ais a strongly positive linear-bounded operator with coefficientγ̅>0,0<γ<γ̅/ρ,Tis a nonexpansive mapping onC,andPF(T)denotes the metric projection on the set of fixed point ofT. Under a suitable different parameter, we obtain strong convergence theorems by using the projection method which solves the variational inequality〈(A-γf)x̃+τ(I-S)x̃,x-x̃〉≥0forx∈F(T), whereτ∈[0,∞). Our results generalize and improve the corresponding results of Yao et al. (2010) and some authors. Furthermore, we give an example which supports our main theorem in the last part.

scholarly journals Hybrid Algorithms for Variational Inequalities Involving a Strict Pseudocontraction

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1502
Author(s):  
Sun Young Cho
Keyword(s):  
Hilbert Space ◽  
Fixed Point ◽  
Variational Inequality ◽  
Variational Inequalities ◽  
Variational Inequality Problem ◽  
Real Hilbert Space ◽  
Fixed Point Problem ◽  
Point Problem ◽  
Strict Pseudocontraction ◽  
Adaptive Step

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.

scholarly journals Iterative Algorithms Approach to Variational Inequalities and Fixed Point Problems

2012 ◽  
Vol 2012 ◽  
pp. 1-15 ◽  
Author(s):  
Yeong-Cheng Liou ◽  
Yonghong Yao ◽  
Chun-Wei Tseng ◽  
Hui-To Lin ◽  
Pei-Xia Yang
Keyword(s):  
Fixed Point ◽  
Variational Inequality ◽  
Variational Inequalities ◽  
Nonexpansive Mapping ◽  
Nonlinear Operator ◽  
Iterative Algorithms ◽  
Fixed Point Problem ◽  
Solution Set ◽  
Point Problem ◽  
General Variational Inequality

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∈Ω.

scholarly journals Triple Hierarchical Variational Inequalities, Systems of Variational Inequalities, and Fixed Point Problems

Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 187
Author(s):  
Lu-Chuan Ceng ◽  
Qing Yuan
Keyword(s):  
Fixed Point ◽  
Variational Inequality ◽  
Variational Inequalities ◽  
General System ◽  
Inequality Constraint ◽  
Fixed Point Problem ◽  
Point Problem ◽  
Common Solution ◽  
Common Fixed Point Problem ◽  
Monotone Variational Inequality

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.

scholarly journals Iterative Algorithms for the Split Problem and Its Convergence Analysis

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Zhangsong Yao ◽  
Arif Rafiq ◽  
Shin Min Kang ◽  
Li-Jun Zhu
Keyword(s):  
Fixed Point ◽  
Common Fixed Point ◽  
Iterative Algorithms ◽  
Split Feasibility Problem ◽  
Fixed Point Problem ◽  
Convergence Result ◽  
Feasibility Problem ◽  
Point Problem ◽  
Common Fixed Point Problem ◽  
Split Common Fixed Point

Now, it is known that the split common fixed point problem is a generalization of the split feasibility problem and of the convex feasibility problem. In this paper, the split common fixed point problem associated with the pseudocontractions is studied. An iterative algorithm has been presented for solving the split common fixed point problem. Strong convergence result is obtained.

Sign in / Sign up

Export Citation Format

Share Document