• Title/Summary/Keyword: $\Gamma$-convex set

Search Result 6, Processing Time 0.015 seconds

WEAK AND STRONG CONVERGENCE TO COMMON FIXED POINTS OF NON-SELF NONEXPANSIVE MAPPINGS

  • Su, Yongfu;Qin, Xiaolong
    • Journal of applied mathematics & informatics
    • /
    • v.24 no.1_2
    • /
    • pp.437-448
    • /
    • 2007
  • Suppose K is a nonempty closed convex nonexpansive retract of a real uniformly convex Banach space E with P as a nonexpansive retraction. Let $T_1,\;T_2\;and\;T_3\;:\;K{\rightarrow}E$ be nonexpansive mappings with nonempty common fixed points set. Let $\{\alpha_n\},\;\{\beta_n\},\;\{\gamma_n\},\;\{\alpha'_n\},\;\{\beta'_n\},\;\{\gamma'_n\},\;\{\alpha'_n\},\;\{\beta'_n\}\;and\;\{\gamma'_n\}$ be real sequences in [0, 1] such that ${\alpha}_n+{\beta}_n+{\gamma}_n={\alpha}'_n+{\beta'_n+\gamma}'_n={\alpha}'_n+{\beta}'_n+{\gamma}'_n=1$, starting from arbitrary $x_1{\in}K$, define the sequence $\{x_n\}$ by $$\{zn=P({\alpha}'_nT_1x_n+{\beta}'_nx_n+{\gamma}'_nw_n)\;yn=P({\alpha}'_nT_2z_n+{\beta}'_nx_n+{\gamma}'_nv_n)\;x_{n+1}=P({\alpha}_nT_3y_n+{\beta}_nx_n+{\gamma}_nu_n)$$ with the restrictions $\sum^\infty_{n=1}{\gamma}_n<\infty,\;\sum^\infty_{n=1}{\gamma}'_n<\infty,\; \sum^\infty_{n=1}{\gamma}'_n<\infty$. (i) If the dual $E^*$ of E has the Kadec-Klee property, then weak convergence of a $\{x_n\}$ to some $x^*{\in}F(T_1){\cap}{F}(T_2){\cap}(T_3)$ is proved; (ii) If $T_1,\;T_2\;and\;T_3$ satisfy condition(A'), then strong convergence of $\{x_n\}$ to some $x^*{\in}F(T_1){\cap}{F}(T_2){\cap}(T_3)$ is obtained.

COINCIDENCE THEOREMS ON A PRODUCT OF GENERALIZED CONVEX SPACES AND APPLICATIONS TO EQUILIBRIA

  • Park, Se-Hie;Kim, Hoon-Joo
    • Journal of the Korean Mathematical Society
    • /
    • v.36 no.4
    • /
    • pp.813-828
    • /
    • 1999
  • In this paper, we give a Peleg type KKM theorem on G-convex spaces and using this, we obtain a coincidence theorem. First, these results are applied to a whole intersection property, a section property, and an analytic alternative for multimaps. Secondly, these are used to proved existence theorems of equilibrium points in qualitative games with preference correspondences and in n-person games with constraint and preference correspondences for non-paracompact wetting of commodity spaces.

  • PDF

FIXED POINT THEOREMS FOR MӦNCH TYPE MAPS IN ABSTRACT CONVEX UNIFORM SPACES

  • Kim, Hoonjoo
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.34 no.4
    • /
    • pp.345-353
    • /
    • 2021
  • In this paper, first, we present new fixed point theorems for Mönch type multimaps on abstract convex uniform spaces and, also, a fixed point theorem for Mönch type multimaps in Hausdorff KKM L𝚪-spaces. Second, we show that Mönch type multimaps in the better admissible class defined on an L𝚪-space have fixed point properties whenever their ranges are Klee approximable. Finally, we obtain fixed point theorems on 𝔎ℭ-maps whose ranges are 𝚽-sets.

A crofton style formula and its application on the unit sphere $ *$

  • Y. D. Chai;Lee, Young-Soo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.33 no.4
    • /
    • pp.537-544
    • /
    • 1996
  • Crofton's formula on Euclidean plane $E^2$ states: Let $\Gamma$ be a rectifiable curve of length L and let G be a straight line. Then $$ \int_{G \cap \Gamma \neq \phi} n dG = 2L $$ where n is the number of the intersection points of G with the curve $\Gamma$.

  • PDF

A GENERAL ITERATIVE ALGORITHM FOR A FINITE FAMILY OF NONEXPANSIVE MAPPINGS IN A HILBERT SPACE

  • Thianwan, Sornsak
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.1_2
    • /
    • pp.13-30
    • /
    • 2010
  • Let C be a nonempty closed convex subset of a real Hilbert space H. Consider the following iterative algorithm given by $x_0\;{\in}\;C$ arbitrarily chosen, $x_{n+1}\;=\;{\alpha}_n{\gamma}f(W_nx_n)+{\beta}_nx_n+((1-{\beta}_n)I-{\alpha}_nA)W_nP_C(I-s_nB)x_n$, ${\forall}_n\;{\geq}\;0$, where $\gamma$ > 0, B : C $\rightarrow$ H is a $\beta$-inverse-strongly monotone mapping, f is a contraction of H into itself with a coefficient $\alpha$ (0 < $\alpha$ < 1), $P_C$ is a projection of H onto C, A is a strongly positive linear bounded operator on H and $W_n$ is the W-mapping generated by a finite family of nonexpansive mappings $T_1$, $T_2$, ${\ldots}$, $T_N$ and {$\lambda_{n,1}$}, {$\lambda_{n,2}$}, ${\ldots}$, {$\lambda_{n,N}$}. Nonexpansivity of each $T_i$ ensures the nonexpansivity of $W_n$. We prove that the sequence {$x_n$} generated by the above iterative algorithm converges strongly to a common fixed point $q\;{\in}\;F$ := $\bigcap^N_{i=1}F(T_i)\;\bigcap\;VI(C,\;B)$ which solves the variational inequality $\langle({\gamma}f\;-\;A)q,\;p\;-\;q{\rangle}\;{\leq}\;0$ for all $p\;{\in}\;F$. Using this result, we consider the problem of finding a common fixed point of a finite family of nonexpansive mappings and a strictly pseudocontractive mapping and the problem of finding a common element of the set of common fixed points of a finite family of nonexpansive mappings and the set of zeros of an inverse-strongly monotone mapping. The results obtained in this paper extend and improve the several recent results in this area.

An Implementation of an Edge-based Algorithm for Separating and Intersecting Spherical Polygons (구 볼록 다각형 들의 분리 및 교차를 위한 간선 기반 알고리즘의 구현)

  • Ha, Jong-Seong;Cheon, Eun-Hong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.9
    • /
    • pp.479-490
    • /
    • 2001
  • In this paper, we consider the method of partitioning a sphere into faces with a set of spherical convex polygons $\Gamma$=${P_1...P_n}$ for determining the maximum of minimum intersection. This problem is commonly related with five geometric problems that fin the densest hemisphere containing the maximum subset of $\Gamma$, a great circle separating $\Gamma$, a great circle bisecting $\Gamma$ and a great circle intersecting the minimum or maximum subset of $\Gamma$. In order to efficiently compute the minimum or maximum intersection of spherical polygons. we take the approach of edge-based partition, in which the ownerships of edges rather than faces are manipulated as the sphere is incrementally partitioned by each of the polygons. Finally, by gathering the unordered split edges with the maximum number of ownerships. we approximately obtain the centroids of the solution faces without constructing their boundaries. Our algorithm for finding the maximum intersection is analyzed to have an efficient time complexity O(nv) where n and v respectively, are the numbers of polygons and all vertices. Furthermore, it is practical from the view of implementation, since it computes numerical values. robustly and deals with all the degenerate cases, Using the similar approach, the boundary of a general intersection can be constructed in O(nv+LlogL) time, where : is the output-senstive number of solution edges.

  • PDF