首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Klee sets and Chebyshev centers for the right Bregman distance
Authors:Heinz H Bauschke  Mason S Macklem  Jason B Sewell  Xianfu Wang
Institution:1. Mathematics, Irving K. Barber School, UBC Okanagan, Kelowna, British Columbia V1V 1V7, Canada;2. Combinatorics & Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Abstract:We systematically investigate the farthest distance function, farthest points, Klee sets, and Chebyshev centers, with respect to Bregman distances induced by Legendre functions. These objects are of considerable interest in Information Geometry and Machine Learning; when the Legendre function is specialized to the energy, one obtains classical notions from Approximation Theory and Convex Analysis.The contribution of this paper is twofold. First, we provide an affirmative answer to a recently-posed question on whether or not every Klee set with respect to the right Bregman distance is a singleton. Second, we prove uniqueness of the Chebyshev center and we present a characterization that relates to previous works by Garkavi, by Klee, and by Nielsen and Nock.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号