Materials: [ Cód.: ElipINElipORPOly.mlx ] [ PDF ]
This video discusses the problem of obtaining the maximum volume ellipsoid inside a convex body defined as the intersection of polyhedra and ellipsoidal sets, not centered neither symmetric with respect to the origin as in other prior videos of the collection; well, as we are detailing a 2D example, we will actually speak abput polygons and maximum area ellipse, but the ideas efficiently generalise to higher dimensions in a trivial way.
We use Matlab+YALMIP+SeDuMi to solve the associated semidefinite programming, setting linear matrix inequalities and a ‘geomean’ objective function (used by Yalmip/SeDuMi instead of ‘logdet’).
*Link to my [ whole collection] of videos in English. Link to larger [ Colección completa] in Spanish.
Colección completa en ESPA
Previous LMI demos: largest ellipse inside other poliedra/ellipses (2), largest area (geomean)
Next LMI sets (SDP-representable sets, spectrahedra): definition, basic properties and 2D examples
Full collection in ENGLISH [View all]:
Previous Distance between ellipses: semidefinite programming (SDP/LMI, linear matrix inequalities)
Next LMI sets (SDP-representable sets, spectrahedra): definition, basic properties and 2D examples