Semidefinite programming for optimizing convex bodies under width constraints
From MaRDI portal
Publication:2905348
Recommendations
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
(8)- New approaches for optimizing over the semimetric polytope
- Maximization of the Steklov eigenvalues with a diameter constraint
- Parametric shape optimization using the support function
- The log-Brunn-Minkowski inequality in \(\mathbb{R}^3\)
- Minimization of the eigenvalues of the Dirichlet-Laplacian with a diameter constraint
- Shape optimization under width constraint
- Optimal design of sensors via geometric criteria
- Numerical shape optimization among convex sets
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)