Bounds on polarization problems on compact sets via mixed integer programming
From MaRDI portal
Publication:6429967
arXiv2303.10101MaRDI QIDQ6429967FDOQ6429967
Authors: Jan Rolfes, Robert Schüler, Marc C. Zimmermann 
Publication date: 17 March 2023
Abstract: Finding point configurations, that yield the maximum polarization (Chebyshev constant) is gaining interest in the field of geometric optimization. In the present article, we study the problem of unconstrained maximum polarization on compact sets. In particular, we discuss necessary conditions for local optimality, such as that a locally optimal configuration is always contained in the convex hull of the respective darkest points. Building on this, we propose two sequences of mixed-integer linear programs in order to compute lower and upper bounds on the maximal polarization, where the lower bound is constructive. Moreover, we prove the convergence of these sequences towards the maximal polarization.
Mixed integer programming (90C11) Discrete potential theory (31C20) Computational methods for problems pertaining to geometry (51-08)
This page was built for publication: Bounds on polarization problems on compact sets via mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6429967)
