Semidefinite programming for optimizing convex bodies under width constraints

Didier Henrion
Centre National de la Recherche Scientifique (CNRS)
Laboratoire d'Analyse et d'Architecture des Systemes (LAAS)

We consider the problem of minimizing a functional (like the area, perimeter, surface) within the class of convex bodies whose support functions are trigonometric polynomials. The convexity constraint is transformed via the Fejer-Riesz theorem on positive trigonometric polynomials into a semidefinite programming problem. Several problems such as the minimization of the area in the class of constant width planar bodies, rotors and space bodies of revolution are revisited.
The approach seems promising to investigate more difficult optimization problems in the class of three-dimensional convex bodies.



Joint work with Terence Bayen, Department of Mathematics, University of Montpellier, France.

Presentation (PDF File)

Back to Workshop I: Convex Optimization and Algebraic Geometry