chebyshev center
Recently Published Documents


TOTAL DOCUMENTS

28
(FIVE YEARS 8)

H-INDEX

6
(FIVE YEARS 1)

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Laishram Shanjit ◽  
Yumnam Rohen ◽  
Sumit Chandok ◽  
M. Bina Devi

In this paper, we prove a sufficient condition that every nonempty closed convex bounded pair M , N in a reflexive Banach space B satisfying Opial’s condition has proximal normal structure. We analyze the relatively nonexpansive self-mapping T on M ∪ N satisfying T M ⊆ M and T N ⊆ N , to show that Ishikawa’s and Halpern’s iteration converges to the best proximity point. Also, we prove that under relatively isometry self-mapping T on M ∪ N satisfying T N ⊆ N and T M ⊆ M , Ishikawa’s iteration converges to the best proximity point in the collection of all Chebyshev centers of N relative to M . Some illustrative examples are provided to support our results.


2020 ◽  
Vol 30 (4) ◽  
pp. 429-442
Author(s):  
Pavel Lebedev ◽  
Vladimir Ushakov

We studied the problem of optimizing the Hausdorff distance between two convex polygons. Its minimization is chosen as the criterion of optimality. It is believed that one of the polygons can make arbitrary movements on the plane, including parallel transfer and rotation with the center at any point. The other polygon is considered to be motionless. Iterative algorithms for the phased shift and rotation of the polygon are developed and implemented programmatically, providing a decrease in the Hausdorff distance between it and the fixed polygon. Theorems on the correctness of algorithms for a wide class of cases are proved. Moreover, the geometric properties of the Chebyshev center of a compact set and the differential properties of the Euclidean function of distance to a convex set are essentially used. When implementing the software package, it is possible to run multiple times in order to identify the best found polygon position. A number of examples are simulated.


2019 ◽  
Vol 106 (120) ◽  
pp. 47-51
Author(s):  
T.D. Narang

A Chebyshev center of a set A in a metric space (X,d) is a point of X best approximating the set A i.e., it is a point x0 ? X such that supy?A d(x0,y) = infx?X supy?A d(x,y). We discuss the existence and uniqueness of such points in metric spaces thereby generalizing and extending several known result on the subject.


Sign in / Sign up

Export Citation Format

Share Document