scholarly journals Convergence Analysis of ParallelS-Iteration Process for System of Generalized Variational Inequalities

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
D. R. Sahu ◽  
Shin Min Kang ◽  
Ajeet Kumar
Keyword(s):  
Hilbert Space ◽  
Variational Inequalities ◽  
Real Hilbert Space ◽  
Iteration Process ◽  
Mann Iteration ◽  
Generalized Variational Inequalities ◽  
Parallel Iteration ◽  
Mann Iteration Process ◽  
Iteration Processes ◽  
New System

We consider a new system of generalized variational inequalities (SGVI) defined on two closed convex subsets of a real Hilbert space. To find the solution of considered SGVI, a parallel Mann iteration process and a parallelS-iteration process have been proposed and the strong convergence of the sequences generated by these parallel iteration processes is discussed. Numerical example illustrates that the proposed parallelS-iteration process has an advantage over parallel Mann iteration process in computing altering points of some mappings.

scholarly journals On New Picard-Mann Iterative Approximations with Mixed Errors for Implicit Midpoint Rule and Applications

2019 ◽  
Vol 2019 ◽  
pp. 1-13
Author(s):  
Teng-fei Li ◽  
Heng-you Lan
Keyword(s):  
Optimal Control Problems ◽  
Nonexpansive Mappings ◽  
Elliptic Boundary ◽  
Iteration Process ◽  
Implicit Midpoint Rule ◽  
Mann Iteration ◽  
Midpoint Rule ◽  
Elliptic Boundary Value ◽  
Mann Iteration Process ◽  
Iteration Processes

In order to solve (partial) differential equations, implicit midpoint rules are often employed as a powerful numerical method. The purpose of this paper is to introduce and study a class of new Picard-Mann iteration processes with mixed errors for the implicit midpoint rules, which is different from existing methods in the literature, and to analyze the convergence and stability of the proposed method. Further, some numerical examples and applications to optimal control problems with elliptic boundary value constraints are considered via the new Picard-Mann iterative approximations, which shows that the new Picard-Mann iteration process with mixed errors for the implicit midpoint rule of nonexpansive mappings is brand new and more effective than other related iterative processes.

scholarly journals On the Mann and Ishikawa iteration processes

1996 ◽  
Vol 1 (4) ◽  
pp. 341-349
Author(s):  
Zhou Haiyun ◽  
Jia Yuting
Keyword(s):  
Strong Convergence ◽  
Iteration Process ◽  
Accretive Operators ◽  
Mann Iteration ◽  
Ishikawa Iteration ◽  
Ishikawa Iteration Process ◽  
Mann Iteration Process ◽  
Iteration Processes

It is shown that a result of Chidume, involving the strong convergence of the Mann iteration process for continuous strongly accretive operators, is actually a corollary to a result by Nevanlinna and Reich. It is then shown that the Nevanlinna and Reich result can be extended to the case of an Ishikawa iteration process.

scholarly journals A Modified Mann Iteration by Boundary Point Method for Finding Minimum-Norm Fixed Point of Nonexpansive Mappings

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Songnian He ◽  
Wenlong Zhu
Keyword(s):  
Fixed Point ◽  
Strong Convergence ◽  
Boundary Point ◽  
Real Hilbert Space ◽  
Nonexpansive Mappings ◽  
Iteration Process ◽  
Point Method ◽  
Minimum Norm ◽  
Mann Iteration ◽  
Boundary Point Method

LetHbe a real Hilbert space andC⊂H a closed convex subset. LetT:C→Cbe a nonexpansive mapping with the nonempty set of fixed pointsFix(T). Kim and Xu (2005) introduced a modified Mann iterationx0=x∈C,yn=αnxn+(1−αn)Txn,xn+1=βnu+(1−βn)yn, whereu∈Cis an arbitrary (but fixed) element, and{αn}and{βn}are two sequences in(0,1). In the case where0∈C, the minimum-norm fixed point ofTcan be obtained by takingu=0. But in the case where0∉C, this iteration process becomes invalid becausexnmay not belong toC. In order to overcome this weakness, we introduce a new modified Mann iteration by boundary point method (see Section 3 for details) for finding the minimum norm fixed point of Tand prove its strong convergence under some assumptions. Since our algorithm does not involve the computation of the metric projectionPC, which is often used so that the strong convergence is guaranteed, it is easy implementable. Our results improve and extend the results of Kim, Xu, and some others.

scholarly journals Fibonacci–Mann Iteration for Monotone Asymptotically Nonexpansive Mappings in Modular Spaces

Symmetry ◽  
2018 ◽  
Vol 10 (10) ◽  
pp. 481 ◽  
Author(s):  
Buthinah Dehaish ◽  
Mohamed Khamsi
Keyword(s):  
Nonexpansive Mappings ◽  
Iteration Process ◽  
Modular Function ◽  
Function Spaces ◽  
Mann Iteration ◽  
Modular Spaces ◽  
Asymptotically Nonexpansive Mappings ◽  
Asymptotically Nonexpansive ◽  
Modular Function Spaces ◽  
Mann Iteration Process

In this work, we extend the fundamental results of Schu to the class of monotone asymptotically nonexpansive mappings in modular function spaces. In particular, we study the behavior of the Fibonacci–Mann iteration process, introduced recently by Alfuraidan and Khamsi, defined by

scholarly journals Hybrid Projection Algorithm for a New General System of Variational Inequalities in Hilbert Spaces

2012 ◽  
Vol 2012 ◽  
pp. 1-22
Author(s):  
S. Imnang
Keyword(s):  
Hilbert Space ◽  
Variational Inequalities ◽  
Nonexpansive Mapping ◽  
Real Hilbert Space ◽  
General System ◽  
Projection Algorithm ◽  
Common Element ◽  
System Of Variational Inequalities ◽  
Demiclosedness Principle ◽  
Hybrid Projection Algorithm

A new general system of variational inequalities in a real Hilbert space is introduced and studied. The solution of this system is shown to be a fixed point of a nonexpansive mapping. We also introduce a hybrid projection algorithm for finding a common element of the set of solutions of a new general system of variational inequalities, the set of solutions of a mixed equilibrium problem, and the set of fixed points of a nonexpansive mapping in a real Hilbert space. Several strong convergence theorems of the proposed hybrid projection algorithm are established by using the demiclosedness principle. Our results extend and improve recent results announced by many others.

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 The Penalty Method for a New System of Generalized Variational Inequalities

2010 ◽  
Vol 2010 ◽  
pp. 1-8 ◽  
Author(s):  
Yu-Chao Tang ◽  
Li-Wei Liu
Keyword(s):  
Variational Inequalities ◽  
Hilbert Spaces ◽  
Penalty Method ◽  
Existence Of Solution ◽  
Penalty Methods ◽  
Generalized Variational Inequalities ◽  
New System

We consider a new system of generalized variational inequalities (SGVI). Using the penalty methods, we prove the existence of solution of SGVI in Hilbert spaces. Our results extend and improve some known results.

Sign in / Sign up

Export Citation Format

Share Document