This paper concerns the general capacity (GC) problem on metric spaces. Conditions are given under which the strong duality condition holds, that is, GC and its dual GC * are both solvable and their optimal values coincide. Copyright Springer-Verlag Berlin Heidelberg 2001

In this paper, we consider a least square semidefinite programming problem under ellipsoidal data uncertainty. We show that the robustification of this uncertain problem can be reformulated as a semidefinite linear programming problem with an additional second-order cone constraint. We then...