Semidefinite programming for optimizing convex bodies under width constraints

DOI10.1080/10556788.2010.547580MaRDI QIDQ2905348zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Térence Bayen, Didier Henrion

Publication date 27 August 2012

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2010.547580

zbMATH Keywords

convex bodies whose support functions are trigonometric polynomialsFejér--Riesz theoremsemidefinite programming problem

Mathematics Subject Classification ID

Decomposition methods (49M27) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05) Semidefinite programming (90C22)

Recommendations

• Shape optimization under width constraint
• Parametric shape optimization using the support function
• scientific article; zbMATH DE number 5356262
• Semidefinite Programming
• Semidefinite optimization

Cites work

• A direct proof of a theorem of Blaschke and Lebesgue.
• An open global volume minimization problem
• Analytic parametrization of three-dimensional bodies of constant width
• Analytical Parameterization of Rotors and Proof of a Goldberg Conjecture by Optimal Control Theory
• Newton's problem of the body of minimal resistance in the class of convex developable functions
• ON THE MAXIMIZATION OF A CLASS OF FUNCTIONALS ON CONVEX REGIONS, AND THE CHARACTERIZATION OF THE FARTHEST CONVEX SET
• Polygonal approximation of plane convex bodies
• Polygons as optimal shapes with convexity constraint
• Positive trigonometric polynomials and signal processing applications
• Trammel Rotors in Regular Polygons

Cited in

(10)

• Shape optimization under width constraint
• Numerical shape optimization among convex sets
• Parametric shape optimization using the support function
• New approaches for optimizing over the semimetric polytope
• Minimization of the eigenvalues of the Dirichlet-Laplacian with a diameter constraint
• Maximization of the Steklov eigenvalues with a diameter constraint
• The log-Brunn-Minkowski inequality in \(\mathbb{R}^3\)
• Optimal design of sensors via geometric criteria
• Improved description of Blaschke-Santaló diagrams via numerical shape optimization
• On the smallest density of non-separable lattices

Describes a project that uses

Uses Software

• YALMIP
• PENBMI

This page was built for publication: Semidefinite programming for optimizing convex bodies under width constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2905348)