Results 41 to 50 of about 9,111 (245)

Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups

open access: yesJournal of Mathematical Analysis and Applications, 2003
Let \(C\) be a nonempty closed convex subset of a real Hilbert space and \(T:C\to C\) be a nonexpansive mapping. In the present paper, the authors investigate the sequence \(\{x_n\}\) generated by: \[ \begin{cases} x_0=x\in C,\\ y_n=\alpha_nx_n+ (1-\alpha_n)Tx_n,\;\alpha_n \in [0,a),\;a\in[0,1),\\ C_n=\bigl\{z\in C:\| y_n-z\|\leq\| x_n-z \| \bigr ...
Wataru Takahashi, Kazuhide Nakajo
openaire   +2 more sources

Iterative Schemes by a New Generalized Resolvent for a Monotone Mapping and a Relatively Weak Nonexpansive Mapping

open access: yesJournal of Applied Mathematics, 2014
We introduce a new generalized resolvent in a Banach space and discuss some of its properties. Using these properties, we obtain an iterative scheme for finding a point which is a fixed point of relatively weak nonexpansive mapping and a zero of monotone
Xian Wang, Jun-min Chen, Hui Tong
doaj   +1 more source

Approximating of fixed points for Garsia-Falset generalized nonexpansive mappings

open access: yesJournal of New Results in Science, 2023
This paper studies the convergence of fixed points for Garsia-Falset generalized nonexpansive mappings. First, it investigates weak and strong convergence results for Garsia-Falset generalized nonexpansive mappings using the Temir-Korkut iteration in ...
Oruç Zincir, Seyit Temir
doaj   +1 more source

ORBITALLY NONEXPANSIVE MAPPINGS [PDF]

open access: yesBulletin of the Australian Mathematical Society, 2015
We define a class of nonlinear mappings which is properly larger than the class of nonexpansive mappings. We also give a fixed point theorem for this new class of mappings.
openaire   +2 more sources

Strong Convergence of Two Iterative Algorithms for Nonexpansive Mappings in Hilbert Spaces

open access: yesFixed Point Theory and Applications, 2009
We introduce two iterative algorithms for nonexpansive mappings in Hilbert spaces. We prove that the proposed algorithms strongly converge to a fixed point of a nonexpansive mapping T.
Yonghong Yao   +2 more
doaj   +2 more sources

On extremal nonexpansive mappings

open access: yesZeitschrift für Analysis und ihre Anwendungen
We study the extremality of nonexpansive mappings on a non-empty bounded, closed, and convex subset of a normed space (therein specific Banach spaces). We show that surjective isometries are extremal in this sense for many Banach spaces, including Banach spaces with the Radon–Nikodym property and all C(K)
Christian Bargetz   +2 more
openaire   +2 more sources

Dynamics of Hilbert nonexpansive maps [PDF]

open access: yes, 2014
In his work on the foundations of geometry, Hilbert observed that a formula which appeared in works by Beltrami, Cayley, and Klein, gives rise to a complete metric on any bounded convex domain. Some decades later, Garrett Birkhoff and Hans Samelson noted that this metric has interesting applications, when considering certain maps of convex cones that ...
openaire   +3 more sources

ON MULTIVALUED f-NONEXPANSIVE MAPS

open access: yesDemonstratio Mathematica, 1999
The authors prove coincidence, fixed point, and convergence theorems which extend previous results by G. L. Acedo and H.-K. Xu, W. G. Dotson, G. Jungck and S. Sessa, and E. Lami Dozo.
Ian Tweddle, Abdul Latif
openaire   +2 more sources

Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees

open access: yes, 2015
We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly closed ...
Neumann, Eike
core   +1 more source

Efficient Algorithm for the Nonadditive Traffic Assignment Problem With Link Capacity Constraints

open access: yesJournal of Advanced Transportation, Volume 2025, Issue 1, 2025.
This paper presents an insightful examination of the modeling and efficient solution algorithm for the link capacitated nonadditive traffic assignment problem (CNaTAP) to provide highly accurate flow solutions for large‐scale networks. Despite the increasing significance of the CNaTAP, the ability to efficiently solve it for satisfactory accuracy in ...
Wangxin Hu   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy