Klee sets and Chebyshev centers for the right Bregman distance
From MaRDI portal
Publication:979041
DOI10.1016/j.jat.2010.01.001zbMath1200.52006arXiv0908.2013MaRDI QIDQ979041
Heinz H. Bauschke, Mason S. Macklem, Jason B. Sewell, Shawn Xianfu Wang
Publication date: 25 June 2010
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0908.2013
maximal monotone operators; Legendre functions; Bregman distances; Chebyshev centers; Klee sets; right Bregman farthest-distance functions; right Bregman farthest-point maps; subdifferential operators.
90C26: Nonconvex programming, global optimization
52A41: Convex functions and convex programs in convex geometry
26B25: Convexity of real functions of several variables, generalizations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convexity of Chebyshev sets
- Convex analysis and nonlinear optimization. Theory and examples.
- Bregman distances and Klee sets
- Bregman distances and Chebyshev sets
- Totally convex functions for fixed points computation and infinite dimensional optimization
- On the smallest enclosing information disk
- From Hahn--Banach to monotonicity
- Sets with unique farthest points
- The number of farthest points
- Dykstras algorithm with bregman projections: A convergence proof
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Circumspheres and Inner Products.
- Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization
- Farthest points and monotone operators
- Variational Analysis
- ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES