Semidefinite programming for optimizing convex bodies under width constraints

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download
Contributor : Didier Henrion <>
Submitted on : Thursday, June 24, 2010 - 5:00:33 PM
Last modification on : Monday, April 29, 2019 - 3:48:55 PM
Long-term archiving on : Monday, September 27, 2010 - 11:53:10 AM


Files produced by the author(s)


  • HAL Id : hal-00495031, version 1


Terence Bayen, Didier Henrion. Semidefinite programming for optimizing convex bodies under width constraints. Optimization Methods and Software, Taylor & Francis, 2012, 27 (6), pp. 1073-1099. ⟨hal-00495031⟩



Record views


Files downloads