Bregman distances and Klee sets
DOI10.1016/j.jat.2008.08.015zbMath1172.52005arXiv0802.2322OpenAlexW2168287380MaRDI QIDQ1028402
Heinz H. Bauschke, Jane Ye, Shawn Xianfu Wang, Xiao-Ming Yuan
Publication date: 30 June 2009
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0802.2322
maximal monotone operatorsubdifferentialBregman projectionBregman distanceLegendre functionfarthest-point-conjecture
Monotone operators and generalizations (47H05) Convex functions and convex programs in convex geometry (52A41) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex functions, monotone operators and differentiability.
- Convexity of Chebyshev sets
- Convex analysis and nonlinear optimization. Theory and examples.
- Bregman distances and Chebyshev sets
- Minimax monotonicity
- Duality for nonconvex optimization and its applications
- Totally convex functions for fixed points computation and infinite dimensional optimization
- On the multiplicity of Dini subgradients in separable spaces
- Qualitative properties of trajectories of control systems: a survey
- Sets with unique farthest points
- The number of farthest points
- Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization
- Farthest points and monotone operators
- Variational Analysis
- On farthest points of sets
- Best approximation in inner product spaces