• 대한수학회지
• /
• 제53권5호
• /
• pp.1037-1056
• /
• 2016

In this paper, we define the concepts of commute proximally, dominate proximally, weakly dominate proximally, proximal generalized ${\varphi}$-contraction and common best proximity point in probabilistic Menger space. We prove some common best proximity point and common fixed point theorems for dominate proximally and weakly dominate proximally mappings in probabilistic Menger space under certain conditions. Finally we show that proximal generalized ${\varphi}$-contractions have best proximity point in probabilistic Menger space. Our results generalize many known results in metric space.

• 대한수학회보
• /
• 제53권5호
• /
• pp.1363-1371
• /
• 2016

This paper is concerned with best proximity points for multimaps in normed spaces and in hyperconvex metric spaces. Using the generalized KKM theorem, we deduce new best proximity pair theorems for a family of multimaps with unionly open fibers in normed spaces. And we prove a new best proximity point theorem for quasi-lower semicontinuous multimaps in hyperconvex metric spaces.

• Nonlinear Functional Analysis and Applications
• /
• 제27권2호
• /
• pp.261-269
• /
• 2022

The purpose of this paper is to introduce a new generalization class of cyclic mappings, called cyclic generalized 𝜑-weak contraction and obtain a corresponding best proximity point theorem for this cyclic mapping under certain conditions.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제29권4호
• /
• pp.335-352
• /
• 2022

In this paper, we give an extended version of fixed point results for 𝜃-contraction and 𝜃-𝜙-contraction and define a new type of contraction, namely, cyclic 𝜃-contraction and cyclic 𝜃-𝜙-contraction in a complete metric space. Moreover, we prove the existence of best proximity point for cyclic 𝜃-contraction and cyclic 𝜃-𝜙-contraction. Also, we establish best proximity result in the setting of uniformly convex Banach space.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제30권4호
• /
• pp.417-427
• /
• 2023

The purpose of this paper is establish the existence of proximity point for the cyclic B-contraction mapping on metric spaces and uniformly convex Banach spaces. Also, we prove the common proximity point for the S-weakly cyclic B-contraction mapping. In addition, a few examples are provided to demonstrate our findings.

• 충청수학회지
• /
• 제19권1호
• /
• pp.19-26
• /
• 2006

In this paper, using the fixed point theorem for acyclic factorizable multifunctions, we shall prove an existence theorem of general best proximity pairs and equilibrium pairs for free generalized games.

• Nonlinear Functional Analysis and Applications
• /
• 제27권3호
• /
• pp.533-551
• /
• 2022

In this paper, we introduce several types 𝛼-𝜓 interpolative proximal contractions and provide some sufficient conditions to prove the existence of best proximity points for these contractions in metric spaces. In the case of proximal contraction of the first kind, these metric spaces are not necessarily complete. Meanwhile, some new results can derive from our results. Finally, some examples are provided to show the validity of our results.

• Nonlinear Functional Analysis and Applications
• /
• 제29권2호
• /
• pp.581-596
• /
• 2024

A new variety of non-self generalized proximal contraction, called Hardy-Rogers α⁺F-proximal contraction, is shown in this work. Also, with an example, we prove that such contractions satisfying some conditions must have a unique best proximity point. For some particular values of the constants, that we have used to generalize the proximal contraction, we conclude different α⁺F-proximal contraction results of the types Ćirić, Chatterjea, Reich, Kannan, and Banach with proof, that all such type of contractions must have unique best proximity point. We also apply our result to solve a functional equation.

• 충청수학회지
• /
• 제27권1호
• /
• pp.105-112
• /
• 2014

In this paper, we first introduce an R-E-KKM map in the E-convex settings, and next we prove an R-E-KKM theorem which generalizes the KKM theorem and the best proximity theorem simultaneously. As applications, a best proximity theorem and a fixed point theorem in E-convex sets are given.

• Journal of applied mathematics & informatics
• /
• 제29권1_2호
• /
• pp.119-133
• /
• 2011

This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming. We introduce a special self-regular proximity to induce the feasibility step and also to measure proximity to the central path. The result of polynomial complexity coincides with the best-known iteration bound for infeasible interior-point methods, namely, O(n log n/${\varepsilon}$).