Results 41 to 50 of about 5,440 (186)
Strong Convergence of Two Iterative Algorithms for Nonexpansive Mappings in Hilbert Spaces
Fixed 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
A note on strong convergence to common fixed points of nonexpansive mappings in Hilbert spaces [PDF]
, 2009 The aim of this paper is to investigate the links between ${\cal T}_C$-class algorithms, CQ Algorithm and shrinking projection methods. We show that strong convergence of these algorithms are related to coherent ${\cal T}_C$-class sequences of mapping ...
Chancelier, Jean-Philippe
core +3 more sources
Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees
, 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
Convergence theorems for I‐nonexpansive mapping [PDF]
International Journal of Mathematics and Mathematical Sciences, 2006 We establish the weak convergence of a sequence of Mann iterates of an I‐nonexpansive map in a Banach space which satisfies Opial′s condition.
B. E. Rhoades, Seyit Temir
openaire +3 more sources
Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups
Journal 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 +1 more source
Modified Iterative Algorithms for Nonexpansive Mappings [PDF]
International Journal of Stochastic Analysis, 2009 Let H be a real Hilbert space, let S, T be two nonexpansive mappings such that F(S)∩F(T) ≠ ∅, let f be a contractive mapping, and let A be a strongly positive linear bounded operator on H. In this paper, we suggest and consider the strong converegence analysis of a new two‐step iterative algorithms for finding the approximate solution of two ...
Yao, Yonghong +2 more
openaire +2 more sources
A General Dynamic Programming Approach to the Optimal Water Storage Management for Irrigation
Mathematical Methods in the Applied Sciences, Volume 49, Issue 3, Page 1987-1997, February 2026.ABSTRACT This paper proposes a dynamic programming approach targeted to solve a natural resource problem of water storage management for irrigation in an environmentally and socially sustainable way. The problem we address in our formulation, focusing on the control of water storage in tanks, is based on assumptions that are less restrictive than those
Abdelkader Belhenniche +3 more
wiley +1 more source
Multivalued Nonexpansive Mappings and Opial's Condition [PDF]
Proceedings of the American Mathematical Society, 1973 We give relations between a condition introduced by Z. Opial which characterizes weak limits by means of the norm in some Banach spaces and approximations of the identity, in particular for systems of projections. Finally a fixed point theorem for multivalued nonexpansive mappings in a Banach space satisfying this condition is proved; this result ...
openaire +2 more sources
Computational and Mathematical Methods, Volume 2026, Issue 1, 2026.In this article, several new fixed point results are established by employing the Krasnoselskii iteration method for a pair of self‐mappings in Banach spaces. It explores the idea of enriched contraction, conditionally sequential absorbing mappings, and various types of continuity terms. Further, to support our main result, an example is provided which
Priya Goel +4 more
wiley +1 more source
Cut-elimination for the modal Grzegorczyk logic via non-well-founded proofs
, 2017 We present a sequent calculus for the modal Grzegorczyk logic Grz allowing non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.Comment: WOLLIC'17, 12 pages, 1 ...
A Avron +5 more
core +1 more source