On farthest Bregman Voronoi cells

DOI10.1080/02331934.2021.1915313MaRDI QIDQ5077159zbMATH OpenOpenAlexFDO

Authors Juan-Enrique Martínez-Legaz, Maryam Tamadoni Jahromi, Eskandar Naraghirad

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

zbMATH Keywords

Bregman distancefarthest siteVoronoi cell

Mathematics Subject Classification ID

Convexity of real functions of several variables, generalizations (26B25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Recommendations

• On farthest Voronoi cells
• On Bregman Voronoi diagrams
• Bregman Voronoi diagrams
• On the farthest line-segment Voronoi diagram
• On the Farthest Line-Segment Voronoi Diagram
• On metric regularity of Voronoi cells
• On the measure of Voronoi cells
• Farthest-Polygon Voronoi Diagrams
• Farthest-polygon Voronoi diagrams
• scientific article; zbMATH DE number 3945378

Cites work

• A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
• An iterative row-action method for interval convex programming
• Bregman Voronoi diagrams
• Convex Analysis
• Even convexity and optimization. Handling strict inequalities
• Farthest Voronoi diagrams under travel time metrics (extended abstract)
• Farthest-polygon Voronoi diagrams
• scientific article; zbMATH DE number 5305569 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 1241849 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• scientific article; zbMATH DE number 3296905 (Why is no real title available?)
• Low-rank kernel learning with Bregman matrix divergences
• On Bregman-type distances for convex functions and maximally monotone operators
• On farthest Voronoi cells
• On Information and Sufficiency
• Polyhedral Voronoi cells
• The Voronoi inverse mapping
• Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
• Tight bound for farthest-color Voronoi diagrams of line segments
• Voronoi cells via linear inequality systems

Cited in

(7)

• Bregman distances and Klee sets
• On Bregman-type distances and their associated projection mappings
• On farthest Voronoi cells
• A radius of robust feasibility for uncertain farthest Voronoi cells
• Errata corrige on farthest Bregman Voronoi cells
• A Bregman proximal point algorithm without convexity in Banach spaces
• Klee sets and Chebyshev centers for the right Bregman distance

This page was built for publication: On farthest Bregman Voronoi cells

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5077159)