nonempty convex subset
Recently Published Documents


TOTAL DOCUMENTS

4
(FIVE YEARS 0)

H-INDEX

2
(FIVE YEARS 0)

2018 ◽  
Vol 27 (1) ◽  
pp. 63-70
Author(s):  
Adesanmi Alao Mogbademu ◽  

Let K be a nonempty convex subset of a real Banach space X. Let T be a nearly weak uniformly L-Lipschitzian mapping. A modified Mann-type iteration scheme is proved to converge strongly to the unique fixed point of T. Our result is a significant improvement and generalization of several known results in this area of research. We give a specific example to support our result. Furthermore, an interesting equivalence of T-stability result between the convergence of modified Mann-type and modified Mann iterations is included.


2012 ◽  
Vol 28 (2) ◽  
pp. 329-336
Author(s):  
IOAN A. RUS ◽  

Let (X, +, R, →) be a vectorial L-space, Y ⊂ X a nonempty convex subset of X and f : Y → Y be an operator with Ff := {x ∈ Y | f(x) = x} 6= ∅. Let 0 < λ < 1 and let fλ be the Krasnoselskii operator corresponding to f, i.e., fλ(x) := (1 − λ)x + λf(x), x ∈ Y. We suppose that fλ is a weakly Picard operator (see I. A. Rus, Picard operators and applications, Sc. Math. Japonicae, 58 (2003), No. 1, 191-219). The aim of this paper is to study some properties of the fixed points of the operator f: Gronwall lemmas and comparison lemmas (when (X, +, R, →, ≤) is an ordered L-space) and data dependence (when X is a Banach space). Some applications are also given.


2002 ◽  
Vol 66 (1) ◽  
pp. 43-56 ◽  
Author(s):  
M. Ruiz Galán ◽  
S. Simons

The main result of this paper is a sufficient condition for the minimax relation to hold for the canonical bilinear form on X × Y, where X is a nonempty convex subset of a real locally convex space and Y is a nonempty convex subset of its dual. Using the known “converse minimax theorem”, this result leads easily to a nonlinear generalisation of James's (“sup”) theorem. We give a brief discussion of the connections with the “sup-limsup theorem” and, in the appendix to the paper, we give a simple, direct proof (using Goldstine's theorem) of the converse minimax theorem referred to above, valid for the special case of a normed space.


1992 ◽  
Vol 15 (4) ◽  
pp. 659-661 ◽  
Author(s):  
A. Carbone

The following theorem is proved and several fixed point theorems and coincidence theorems are derived as corollaries. LetCbe a nonempty convex subset of a normed linear spaceX,f:C→Xa continuous function,g:C→Ccontinuous, onto and almost quasi-convex. Assume thatChas a nonempty compact convex subsetDsuch that the setA={y∈C:‖g(x)−f(y)‖≥‖g(y)−f(y)‖   for   all   x∈D}is compact.Then there is a pointy0∈Csuch that‖g(y0)−f(y0)‖=d(f(y0),C).


Sign in / Sign up

Export Citation Format

Share Document