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
Optimization Methods and Software, Taylor & Francis: STM, Behavioural Science and Public Health Titles, 2012, 27 (6), pp. 1073-1099


https://hal.archives-ouvertes.fr/hal-00495031
Contributor : Didier Henrion <>
Submitted on : Thursday, June 24, 2010 - 5:00:33 PM
Last modification on : Tuesday, October 28, 2014 - 6:59:53 PM

Files

supsdp.pdf
fileSource_public_author

Identifiers

  • HAL Id : hal-00495031, version 1

Collections

Citation

Terence Bayen, Didier Henrion. Semidefinite programming for optimizing convex bodies under width constraints. Optimization Methods and Software, Taylor & Francis: STM, Behavioural Science and Public Health Titles, 2012, 27 (6), pp. 1073-1099. <hal-00495031>

Export

Share

Metrics

Consultation de
la notice

117

Téléchargement du document

53