Abstract

In this paper we study robust convex quadratically constrained programs, a subset of the class of robust convex programs introduced by Ben-Tal and Nemirovski [4]. Unlike [4], our focus in this paper is to identify uncertainty structures that allow the corresponding robust quadratically constrained programs to be reformulated as second-order cone programs. We propose three classes of uncertainty sets that satisfy this criterion and present examples where these classes of uncertainty sets are natural. 1 Problem formulation A generic quadratically constrained program (QCP) is defined as follows.

Citations