Ten serwis zostanie wyłączony 2025-02-11.
Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
The purpose of this paper is to study a split generalized mixed equilibrium problem and a fixed point problem for nonspreading mappings in real Hilbert spaces. We introduce a new iterative algorithm and prove its strong convergence for approximating a common solution of a split generalized mixed equilibrium problem and a fixed point problem for nonspreading mappings in real Hilbert spaces. Our algorithm is developed by combining a modified accelerated Mann algorithm and a viscosity approximation method to obtain a new faster iterative algorithm for finding a common solution of these problems in real Hilbert spaces. Also, our algorithm does not require any prior knowledge of the bounded linear operator norm. We further give a numerical example to show the efficiency and consistency of our algorithm. Our result improves and compliments many recent results previously obtained in this direction in the literature.
2
Content available remote On the proximal point algorithm and demimetric mappings in CAT(0) spaces
100%
EN
In this paper, we introduce and study the class of demimetric mappings in CAT(0) spaces. We then propose a modified proximal point algorithm for approximating a common solution of a finite family of minimization problems and fixed point problems in CAT(0) spaces. Furthermore, we establish strong convergence of the proposed algorithm to a common solution of a finite family of minimization problems and fixed point problems for a finite family of demimetric mappings in complete CAT(0) spaces. A numerical example which illustrates the applicability of our proposed algorithm is also given. Our results improve and extend some recent results in the literature.
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ć.