Semidefinite programming for optimizing convex bodies under width constraints

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00194284" target="_blank" >RIV/68407700:21230/12:00194284 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1080/10556788.2010.547580" target="_blank" >http://dx.doi.org/10.1080/10556788.2010.547580</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1080/10556788.2010.547580" target="_blank" >10.1080/10556788.2010.547580</a>

Result language
angličtina
Original language name
Semidefinite programming for optimizing convex bodies under width constraints
Original language description
We consider the problem of minimizing a functional (such as the area, perimeter and surface) within the class of convex bodies whose support functions are trigonometric polynomials. The convexity constraint is transformed via the Fejér-Riesz theorem on positive trigonometric polynomials into a semidefinite programming problem. Several problems such as the minimization of the area in the class of constantwidth 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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GAP103%2F10%2F0628" target="_blank" >GAP103/10/0628: Semidefinite programming for nonlinear dynamical systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)