STRONG DUALITY IN GEOMETRIC OPTIMIZATION USING A CONIC FORMULATION

Geometric optimization can be cast as a convex problem with an interesting
strong duality property : the optimum duality gap is equal to zero.

In this talk, we formulate this problem as a primal-dual pair using a dedicated
convex cone, which allows us to derive this strong duality property easily.