scholarly journals A novel algorithm for approximating common solution of a system of monotone inclusion problems and common fixed point problem

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Mohammad Eslamian ◽  
Ahmad Kamandi
Keyword(s):  
Fixed Point Problem ◽  
Common Fixed Points ◽  
Common Element ◽  
Feasibility Problem ◽  
Point Problem ◽  
Monotone Inclusion ◽  
Splitting Algorithm ◽  
Inclusion Problems ◽  
Inertial Algorithm ◽  
The Common

<p style='text-indent:20px;'>In this paper, we study the problem of finding a common element of the set of solutions of a system of monotone inclusion problems and the set of common fixed points of a finite family of generalized demimetric mappings in Hilbert spaces. We propose a new and efficient algorithm for solving this problem. Our method relies on the inertial algorithm, Tseng's splitting algorithm and the viscosity algorithm. Strong convergence analysis of the proposed method is established under standard and mild conditions. As applications we use our algorithm for finding the common solutions to variational inequality problems, the constrained multiple-set split convex feasibility problem, the convex minimization problem and the common minimizer problem. Finally, we give some numerical results to show that our proposed algorithm is efficient and implementable from the numerical point of view.</p>

scholarly journals Strong and Weak Convergence Theorems for Equilibrium Problems and Weak Relatively Uniformly Nonexpansive Multivalued Mappings in Banach Spaces

2012 ◽  
Vol 2012 ◽  
pp. 1-13
Author(s):  
Zi-Ming Wang
Keyword(s):  
Weak Convergence ◽  
Equilibrium Problem ◽  
Equilibrium Problems ◽  
Fixed Point Problem ◽  
Common Element ◽  
Multivalued Mappings ◽  
Point Problem ◽  
Strong And Weak Convergence ◽  
Convergence Results ◽  
The Common

Equilibrium problem and fixed point problem are considered. A general iterative algorithm is introduced for finding a common element of the set of solutions to the equilibrium problem and the common set of fixed points of two weak relatively uniformly nonexpansive multivalued mappings. Furthermore, strong and weak convergence results for the common element in the two sets mentioned above are established in some Banach space.

scholarly journals A Real-Time Iterative Projection Scheme for Solving the Common Fixed Point Problem and Its Applications

2018 ◽  
Vol 64 (4) ◽  
pp. 616-636
Author(s):  
A Gibali ◽  
D Teller
Keyword(s):  
Fixed Point ◽  
Common Fixed Point ◽  
Real Time ◽  
Fixed Point Theory ◽  
Point Theory ◽  
Fixed Point Problem ◽  
Feasibility Problem ◽  
Point Problem ◽  
Common Fixed Point Problem ◽  
The Common

In this paper, we are concerned with the Common Fixed Point Problem (CFPP) with demicontractive operators and its special instance, the Convex Feasibility Problem (CFP) in real Hilbert spaces. Motivated by the recent result of Ordon˜ ez et al. [35] and in general, the field of online/real-time algorithms, e.g., [20, 21, 30], in which the entire input is not available from the beginning and given piece-by-piece, we propose an online/real-time iterative scheme for solving CFPPs and CFPs in which the involved operators/sets emerge along time. This scheme is capable of operating on any block, for any finite number of iterations, before moving, in a serial way, to the next block. The scheme is based on the recent novel result of Reich and Zalas [37] known as the Modular String Averaging (MSA) procedure. The convergence of the scheme follows [37] and other classical results in the fields of fixed point theory and variational inequalities, such as [34]. Numerical experiments for linear and non-linear feasibility problems with applications to image recovery are presented and demonstrate the validity and potential applicability of our scheme, e.g., to online/real-time scenarios.

scholarly journals Iterative Scheme for Split Variational Inclusion and a Fixed-Point Problem of a Finite Collection of Nonexpansive Mappings

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
M. Dilshad ◽  
A. F. Aljohani ◽  
M. Akram
Keyword(s):  
Fixed Point ◽  
Iterative Scheme ◽  
Nonexpansive Mappings ◽  
Fixed Point Problem ◽  
Variational Inclusion ◽  
Common Element ◽  
Finite Collection ◽  
Point Problem ◽  
Common Solution ◽  
The Common

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.

scholarly journals An Iterative Method for Finding Common Solution of the Fixed Point Problem of a Finite Family of Nonexpansive Mappings and a Finite Family of Variational Inequality Problems in Hilbert Space

2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Shamshad Husain ◽  
Nisha Singh
Keyword(s):  
Hilbert Space ◽  
Variational Inequality ◽  
Real Hilbert Space ◽  
Nonexpansive Mappings ◽  
Monotone Mapping ◽  
Fixed Point Problem ◽  
Common Fixed Points ◽  
Finite Family ◽  
Common Element ◽  
Point Problem

In this paper, a hybrid iterative algorithm is proposed for finding a common element of the set of common fixed points of finite family of nonexpansive mappings and the set of common solutions of the variational inequality for an inverse strongly monotone mapping on the real Hilbert space. We establish the strong convergence of the proposed method for approximating a common element of the above defined sets under some suitable conditions. The results presented in this paper extend and improve some well-known corresponding results in the earlier and recent literature.

scholarly journals String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yair Censor ◽  
Ariel Nisenbaum
Keyword(s):  
Fixed Point ◽  
Common Fixed Point ◽  
Best Approximation ◽  
Fixed Point Problem ◽  
Feasibility Problem ◽  
Point Problem ◽  
Fixed Point Set ◽  
Averaging Methods ◽  
Point Set ◽  
The Common

AbstractString-averaging is an algorithmic structure used when handling a family of operators in situations where the algorithm in hand requires to employ the operators in a specific order. Sequential orderings are well known, and a simultaneous order means that all operators are used simultaneously (in parallel). String-averaging allows to use strings of indices, constructed by subsets of the index set of all operators, to apply the operators along these strings, and then to combine their end-points in some agreed manner to yield the next iterate of the algorithm. String-averaging methods were discussed and used for solving the common fixed point problem or its important special case of the convex feasibility problem. In this paper we propose and investigate string-averaging methods for the problem of best approximation to the common fixed point set of a family of operators. This problem involves finding a point in the common fixed point set of a family of operators that is closest to a given point, called an anchor point, in contrast with the common fixed point problem that seeks any point in the common fixed point set.We construct string-averaging methods for solving the best approximation problem to the common fixed points set of either finite or infinite families of firmly nonexpansive operators in a real Hilbert space. We show that the simultaneous Halpern–Lions–Wittman–Bauschke algorithm, the Halpern–Wittman algorithm, and the Combettes algorithm, which were not labeled as string-averaging methods, are actually special cases of these methods. Some of our string-averaging methods are labeled as “static” because they use a fixed pre-determined set of strings. Others are labeled as “quasi-dynamic” because they allow the choices of strings to vary, between iterations, in a specific manner and belong to a finite fixed pre-determined set of applicable strings. For the problem of best approximation to the common fixed point set of a family of operators, the full dynamic case that would allow strings to unconditionally vary between iterations remains unsolved, although it exists and is validated in the literature for the convex feasibility problem where it is called “dynamic string-averaging”.

scholarly journals Approximation of common fixed points in 2-Banach spaces with applications

2019 ◽  
Vol 20 (1) ◽  
pp. 43
Author(s):  
D. Ramesh Kumar ◽  
M. Pitchaimani
Keyword(s):  
Fixed Point ◽  
Fixed Points ◽  
Common Fixed Point ◽  
Banach Spaces ◽  
Fixed Point Problem ◽  
Common Fixed Points ◽  
Point Problem ◽  
Contractive Condition ◽  
Common Fixed Point Problem ◽  
The Common

<p>The purpose of this paper is to establish the existence and uniqueness of common fixed points of a family of self-mappings satisfying generalized rational contractive condition in 2-Banach spaces. An example is included to justify our results. We approximate the common fixed point by Mann and Picard type iteration schemes. Further, an application to well-posedness of the common fixed point problem is given. The presented results generalize many known results on 2-Banach spaces.</p>

scholarly journals Mann-Type Inertial Subgradient Extragradient Rules for Variational Inequalities and Common Fixed Points of Nonexpansive and Quasi-Nonexpansive Mappings

Axioms ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 67
Author(s):  
Lu-Chuan Ceng ◽  
Jen-Chih Yao
Keyword(s):  
Real Hilbert Space ◽  
Nonexpansive Mappings ◽  
Fixed Point Problem ◽  
Common Fixed Points ◽  
Point Problem ◽  
Weak Continuity ◽  
Common Solution ◽  
Pseudomonotone Mapping ◽  
Common Fixed Point Problem ◽  
The Common

Suppose that in a real Hilbert space H, the variational inequality problem with Lipschitzian and pseudomonotone mapping A and the common fixed-point problem of a finite family of nonexpansive mappings and a quasi-nonexpansive mapping with a demiclosedness property are represented by the notations VIP and CFPP, respectively. In this article, we suggest two Mann-type inertial subgradient extragradient iterations for finding a common solution of the VIP and CFPP. Our iterative schemes require only calculating one projection onto the feasible set for every iteration, and the strong convergence theorems are established without the assumption of sequentially weak continuity for A. Finally, in order to support the applicability and implementability of our algorithms, we make use of our main results to solve the VIP and CFPP in two illustrating examples.

scholarly journals Common Solution for a Finite Family of Equilibrium Problems, Quasi-Variational Inclusion Problems and Fixed Points on Hadamard Manifolds

Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1161
Author(s):  
Jinhua Zhu ◽  
Jinfang Tang ◽  
Shih-sen Chang ◽  
Min Liu ◽  
Liangcai Zhao
Keyword(s):  
Fixed Point ◽  
Strong Convergence ◽  
Equilibrium Problems ◽  
Fixed Point Problem ◽  
Finite Family ◽  
Variational Inclusion ◽  
Point Problem ◽  
Hadamard Manifolds ◽  
Inclusion Problems ◽  
Common Solution

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.

scholarly journals An alternating iteration algorithm for solving the split equality fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Meixia Li ◽  
Xueling Zhou ◽  
Haitao Che
Keyword(s):  
Fixed Point ◽  
Common Fixed Point ◽  
Split Feasibility Problem ◽  
Fixed Point Problem ◽  
Feasibility Problem ◽  
Iteration Algorithm ◽  
Point Problem ◽  
Contractive Mappings ◽  
Common Fixed Point Problem ◽  
Significant Generalization

Abstract In this paper, we are concerned with the split equality common fixed point problem. It is a significant generalization of the split feasibility problem, which can be used in various disciplines, such as medicine, military and biology, etc. We propose an alternating iteration algorithm for solving the split equality common fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings and prove that the sequence generated by the algorithm converges weakly to the solution of this problem. Finally, some numerical results are shown to confirm the feasibility and efficiency of the proposed algorithm.

An iterative algorithm with inertial technique for solving the split common null point problem in Banach spaces

2021 ◽  
pp. 2250120
Author(s):  
Yan Tang ◽  
Pongsakorn Sunthrayuth
Keyword(s):  
Banach Spaces ◽  
Split Feasibility Problem ◽  
Null Point ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
Point Problem ◽  
Inertial Algorithm ◽  
The Split Feasibility Problem ◽  
Inertial Technique ◽  
Split Feasibility

In this work, we introduce a modified inertial algorithm for solving the split common null point problem without the prior knowledge of the operator norms in Banach spaces. The strong convergence theorem of our method is proved under suitable assumptions. We apply our result to the split feasibility problem, split equilibrium problem and split minimization problem. Finally, we provide some numerical experiments including compressed sensing to illustrate the performances of the proposed method. The result presented in this paper improves and generalizes many recent important results in the literature.

Sign in / Sign up

Export Citation Format

Share Document