Optimization hierarchies for distance-avoiding sets in compact spaces

arXiv2304.05429MaRDI QIDQ6432791FDOQ6432791

Authors: Bram Bekker, Olga Kuryatnikova, Fernando Mário de Oliveira Filho, Juan Vera 

Publication date: 11 April 2023

Abstract: Witsenhausen's problem asks for the maximum fraction $alph{a}_n$ of the $n$-dimensional unit sphere that can be covered by a measurable set containing no pairs of orthogonal points. The best upper bounds for $alph{a}_n$ are given by extensions of the Lov'asz theta number. In this paper, optimization hierarchies based on the Lov'asz theta number, like the Lasserre hierarchy, are extended to Witsenhausen's problem and similar problems. These hierarchies are shown to converge and are used to compute the best upper bounds for $alph{a}_n$ in low dimensions.

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Erd?s problems and related topics of discrete geometry (52C10) Semi-infinite programming (90C34) Distance geometry (51K99)

This page was built for publication: Optimization hierarchies for distance-avoiding sets in compact spaces

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