On farthest Bregman Voronoi cells
From MaRDI portal
Publication:5077159
DOI10.1080/02331934.2021.1915313zbMath1490.52006OpenAlexW3158067144MaRDI QIDQ5077159
Eskandar Naraghirad, Juan-Enrique Martinez-Legaz, Maryam Tamadoni Jahromi
Publication date: 18 May 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2021.1915313
Convexity of real functions of several variables, generalizations (26B25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
On Bregman-type distances and their associated projection mappings, Errata corrige on farthest Bregman Voronoi cells, A radius of robust feasibility for uncertain farthest Voronoi cells
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Voronoi inverse mapping
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
- Farthest-polygon Voronoi diagrams
- Polyhedral Voronoi cells
- An iterative row-action method for interval convex programming
- On Bregman-type distances for convex functions and maximally monotone operators
- Even convexity and optimization. Handling strict inequalities
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
- On farthest Voronoi cells
- Voronoi cells via linear inequality systems
- Farthest Voronoi Diagrams under Travel Time Metrics
- Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments
- Convex Analysis
- On Information and Sufficiency
- Bregman Voronoi diagrams
