Strong duality in parametric robust semi-definite linear programming and exact relaxations

Abstract

This paper addresses the issue of which strong duality holds between parametric robust semi-definite linear optimization problems and their dual programs. In the case of a spectral norm uncertainty set, it yields a corresponding strong duality result with a semi-definite programming as its dual. We also show that the dual can be reformulated as a second-order cone programming problem or a linear programming problem when the constraint uncertainty sets of parametric robust semi-definite linear programs are given in terms of affinely parameterized diagonal matrix.