Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 5

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  problem równowagi
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
In this paper, we propose and study a new inertial iterative algorithm with self-adaptive step size for approximating a common solution of finite family of split monotone variational inclusion problems and fixed point problem of a nonexpansive mapping between a Banach space and a Hilbert space. This method combines the inertial technique with viscosity method and self-adaptive step size for solving the common solution problem. We prove a strong convergence result for the proposed method under some mild conditions. Moreover, we apply our result to study the split feasibility problem and split minimization problem. Finally, we provide some numerical experiments to demonstrate the efficiency of our method in comparison with some well-known methods in the literature. Our method does not require prior knowledge or estimate of the operator norm, which makes it easily implementable unlike so many other methods in the literature, which require prior knowledge of the operator norm for their implementation.
EN
In this paper, we study the problem of finding a common solution of split generalized vector mixed equlibrium problem (SGVMEP), fixed point problem (FPP) and variational inequality problem (VIP). We propose an inertial-type iterative algorithm, which uses a projection onto a feasible set and a linesearch, which can be easily calculated. We prove a strong convergence of the sequence generated by the proposed algorithm to a common solution of SGVMEP, fixed point of a quasi- ϕ -nonexpansive mapping and VIP for a general class of monotone mapping in 2-uniformly convex and uniformly smooth Banach space E1 and a smooth, strictly convex and reflexive Banach space E2 . Some numerical examples are presented to illustrate the performance of our method. Our result improves some existing results in the literature.
EN
In this paper we propose an iterative algorithm based on the hybrid method in mathematical programming for approximating a common fixed point of an infinite family of left Bregman strongly nonexpansive mappings which also solves a finite system of equilibrium problems in a reflexive real Banach space.We further prove that our iterative sequence converges strongly to a common fixed point of an infinite family of left Bregman strongly nonexpansive mappings which is also a common solution to a finite system of equilibrium problems. Our result extends many recent and important results in the literature.
EN
In this paper, we construct a new iterative scheme by hybrid methods to approximate a common element in the fixed points set of an infinite family of relatively quasi-nonexpansive mappings, the solutions set of a variational inequality problem and the solutions set of a system of generalized mixed equilibrium problems in a 2-uniformly convex real Banach space which is also uniformly smooth. Then, we prove strong convergence of the scheme to a common element of the three sets. We give several applications of our results in a Banach space. Our results extend many known recent results in the literature.
EN
In this paper, we introduce some iterative schemes for findin a common element of the set of fixed points of a k-strict pseudo-contractive mapping, the set of solutions of the variational inequality and the set of solutions of an equilibrium problem in a Hilbert space. The authors use the convex combination technique to show that the iterative sequences converge strongly to a common element of the three sets. The results of this paper extend and improve the results of Y. Su et al. [9], S. Plubtieng and R. Punpaeng [7], X. Qin et al. [8] and S. Takahashi and W. Takahashi [10].
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.