Abstract
In this paper we analyze the existence of points of a subset S of a linear space X where the shortest distance to a point x of X with respect to an asymmetric norm q is attained ( q-nearest points). Since the structure of an asymmetric norm do not provide in general uniqueness of such points—due to the fact that the separation properties in these spaces are in general weaker than in normed spaces—we develop a technique to find particular subsets of the set of q-nearest points—that we call optimal distance points—that are also optimal for the norm q s associated to the asymmetric norm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
