×

Fixed points of monotone nonexpansive mappings with a graph. (English) Zbl 1327.47047

Let \((X,\|\cdot\|)\) be a Banach space and \(\tau\) be a Hausdorff topology on \(X\) which is weaker than the norm topology. In the present paper, the author proves the following.
Theorem 3.1. Let \(X\) be a Banach space which satisfies the \(\tau\)-Opial condition, let \(C\) be a bounded convex \(\tau\)-compact nonempty subset of \(X\) not reduced to one point and \(G\) be a directed graph such that the set of vertices \(V(G)=C\). Assume that the triple \((C,\|\cdot\|, G)\) has the property \((P)\) and the \(G\)-intervals are convex. If \(T: C\to C\) is a \(G\)-monotone nonexpansive mapping with some \(x_0\in C\) such that \((x_0,T_0)\in E(G)\) (\(=\) the set of edges), then \(T\) has a fixed point.

MSC:

47H10 Fixed-point theorems
47H09 Contraction-type mappings, nonexpansive mappings, \(A\)-proper mappings, etc.
47H05 Monotone operators and generalizations
46B20 Geometry and structure of normed linear spaces
05C20 Directed graphs (digraphs), tournaments

References:

[1] Banach, S: Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fundam. Math. 3, 133-181 (1922) · JFM 48.0201.01
[2] Nieto, JJ, Rodríguez-López, R: Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations. Order 22, 223-239 (2005) · Zbl 1095.47013 · doi:10.1007/s11083-005-9018-5
[3] Ran, ACM, Reurings, MCB: A fixed point theorem in partially ordered sets and some applications to matrix equations. Proc. Am. Math. Soc. 132, 1435-1443 (2004) · Zbl 1060.47056 · doi:10.1090/S0002-9939-03-07220-4
[4] Alfuraidan, MR: Remarks on monotone multivalued mappings on a metric space with a graph. Preprint · Zbl 1469.54043
[5] Bojor, F: Fixed point theorems for Reich type contractions on metric spaces with a graph. Nonlinear Anal. 75(9), 3895-3901 (2012) · Zbl 1250.54044 · doi:10.1016/j.na.2012.02.009
[6] Jachymski, J: The contraction principle for mappings on a metric space with a graph. Proc. Am. Math. Soc. 136, 1359-1373 (2007) · Zbl 1139.47040 · doi:10.1090/S0002-9939-07-09110-1
[7] Browder, FE: Nonexpansive nonlinear operators in a Banach space. Proc. Natl. Acad. Sci. USA 54, 1041-1044 (1965) · Zbl 0128.35801 · doi:10.1073/pnas.54.4.1041
[8] Bachar, M, Khamsi, MA: Fixed points of monotone nonexpansive mappings. Preprint · Zbl 1497.47078
[9] Diestel, R: Graph Theory. Springer, New York (2000) · Zbl 0957.05001
[10] Johnsonbaugh, R: Discrete Mathematics. Prentice Hall, New York (1997) · Zbl 0860.68078
[11] Krasnoselskii, MA: Two observations about the method of successive approximations. Usp. Mat. Nauk 10, 123-127 (1955) · Zbl 0064.12002
[12] Berinde, V: Iterative Approximation of Fixed Points, 2nd edn. Lecture Notes in Mathematics, vol. 1912. Springer, Berlin (2007) · Zbl 1165.47047
[13] Chidume, C: Geometric Properties of Banach Spaces and Nonlinear Iterations. Lecture Notes in Mathematics, vol. 1965. Springer, London (2009) · Zbl 1167.47002
[14] Ishikawa, S: Fixed points and iteration of a nonexpansive mapping in a Banach space. Proc. Am. Math. Soc. 59, 65-71 (1976) · Zbl 0352.47024 · doi:10.1090/S0002-9939-1976-0412909-X
[15] Goebel, K, Kirk, WA: Iteration processes for nonexpansive mappings. Contemp. Math. 21, 115-123 (1983) · Zbl 0525.47040 · doi:10.1090/conm/021/729507
[16] Goebel, K, Kirk, WA: Topics in Metric Fixed Point Theory. Cambridge Stud. Adv. Math., vol. 28. Cambridge University Press, Cambridge (1990) · Zbl 0708.47031 · doi:10.1017/CBO9780511526152
[17] Kirk, WA; Sine, RC (ed.), Fixed point theory for nonexpansive mappings II, No. 18, 121-140 (1983) · Zbl 0511.47037 · doi:10.1090/conm/018/728596
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.