Materials: [ Cód.: DistanceLMIsetsENG.mlx ] [ PDF ]
This video generalises the ideas in video [
The simplest case is computing the minimum distance between intersections of ellipsoids, so the code of the above-referred video is modified (just a couple of lines need modifications) to illustrate how LMI/SDP can handle the problem in a straightforward way (up to some numerical computation tolerances, of course).
*Link to my [ whole collection] of videos in English. Link to larger [ Colección completa] in Spanish.
Colección completa en ESPA
Previous Distance between ellipses: semidefinite programming (SDP/LMI, linear matrix inequalities)
Next Control robusto (coste LQR garantizado) de procesos lineales politópicos con desigualdades matriciales lineales (LMI): teoría y ejemplo Matlab
Full collection in ENGLISH [View all]:
Previous LMI sets (3): plotting routine and applications
Next LMI sets (4): scaling, perspective cones, set interpolation, convex hull