EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1707. SDP hierarchies for distance-avoiding sets on compact spaces
Invited abstract in session WD-38: Advances in polynomial optimization and its applications, stream Conic Optimization: Theory, Algorithms, and Applications.
Wednesday, 14:30-16:00Room: 34 (building: 306)
Authors (first author is the speaker)
| 1. | Bram Bekker
|
| DIAM, Delft University of Technology |
Abstract
Witsenhausen's problem asks for the maximum fraction αn of the n-dimensional unit sphere that can be covered by a measurable set containing no pairs of orthogonal points. We extended well known optimization hierarchies based on the Lovász theta number, like the Lasserre hierarchy, to Witsenhausen's problem and similar problems. These hierarchies are shown to converge and are used to compute the best upper bounds known for αn in low dimensions.
Keywords
- Convex Optimization
- Programming, Nonlinear
Status: accepted
Back to the list of papers