To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
A geometric property of convex sets which is equivalent to a minimax inequality of the Ky Fan type is formulated. This property is used directly to prove minimax inequalities of the von Neumann type, minimax inequalities of the Fan-Kneser type, and fixed point theorems for inward and outward maps.
Let E be a Hausdorff topological vector space, let K be a nonempty compact convex subset of E and let f, g: K → 2E be upper semicontinuous such that for each x ∈ K, f(x) and g(x) are nonempty compact convex. Let Ω ⊂ 2E be convex and contain all sets of the form x − f(x), y − x + g(x) − f(x), for x, y ∈ K. Suppose p: K × Ω →, R satisfies: (i) for each (x, A) ∈ K × Ω and for ε > 0, there exist a neighborhood U of x in K and an open subset set G in E with A ⊂ G such that for all (y, B) ∈ K ×Ω with y ∈ U and B ⊂ G, | p(y, B) - p(x, A)| < ε, and (ii) for each fixed X ∈ K, p(x, ·) is a convex function on Ω. If p(x, x − f(x)) ≤ p(x, g(x) − f(x)) for all x ∈ K, and if, for each x ∈ K with f(x) ∩ g(x) = ø, there exists y ∈ K with p(x, y − x + g(x) − f(x)) < p(x, x − f(x)), then there exists an x0 ∈ K such that f(x0) ∩ g(x0) ≠ ø. Another coincidence theorem on a nonempty compact convex subset of a Hausdorff locally convex topological vector space is also given.
Some results on fixed point of asymptotically regular multivalued mapping are obtained in metric spaces. The structure of common fixed points and coincidence points of a pair of compatible multivalued mappings is also discussed. Our work generalizes known results of Aubin and Siegel, Dube, Dube and Singh, Hardy and Rogers, Hu, Iseki, Jungck, Kaneko, Nadler, Ray and Shiau, Tan and Wong.
We give an explicit Krasnoselski–Mann type method for finding common solutions of the following system of equilibrium and hierarchical fixed points: where C is a closed convex subset of a Hilbert space H, G:C×C→ℝ is an equilibrium function, T:C→C is a nonexpansive mapping with Fix(T) its set of fixed points and f:C→C is a ρ-contraction. Our algorithm is constructed and proved using the idea of the paper of [Y. Yao and Y.-C. Liou, ‘Weak and strong convergence of Krasnosel’skiĭ–Mann iteration for hierarchical fixed point problems’, Inverse Problems24 (2008), 501–508], in which only the variational inequality problem of finding hierarchically a fixed point of a nonexpansive mapping T with respect to a ρ-contraction f was considered. The paper follows the lines of research of corresponding results of Moudafi and Théra.
This paper focuses on the analyticity of the limiting behavior of a class of dynamical systems defined by iteration of non-expansive random operators. The analyticity is understood with respect to the parameters which govern the law of the operators. The proofs are based on contraction with respect to certain projective semi-norms. Several examples are considered, including Lyapunov exponents associated with products of random matrices both in the conventional algebra, and in the (max, +) semi-field, and Lyapunov exponents associated with non-linear dynamical systems arising in stochastic control. For the class of reducible operators (defined in the paper), we also address the issue of analyticity of the expectation of functionals of the limiting behavior, and connect this with contraction properties with respect to the supremum norm. We give several applications to queueing theory.