Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Robust SOS-Convex Polynomial Programs: Exact SDP Relaxations   This paper studies robust solutions and semidefinite linear programming (SDP)
relaxations of a class of convex polynomial programs in the face of data
uncertainty. The class of convex programs, called robust SOS-convex programs,
includes robust quadratically constrained convex programs and robust separable
convex polynomial programs. It establishes sums of squares polynomial
representations characterizing robust solutions and exact SDP-relaxations of
robust SOS-convex programs under various commonly used uncertainty sets. In
particular, the results show that the polytopic and ellipsoidal uncertainty
sets, that allow second-order cone re-formulations of robust quadratically
constrained programs, continue to permit exact SDP-relaxations for a broad
class of robust SOS-convex programs. They also yield exact second-order cone
relaxation for robust quadratically constrained programs.

31
The categories of this paper are: ao-sci
29
The categories of this paper are: funct-an
37
The categories of this paper are: supr-con
17
The categories of this paper are: q-fin
33
The categories of this paper are: plasm-ph
15
The categories of this paper are: nucl-ex
30
The categories of this paper are: q-alg
35
The categories of this paper are: mtrl-th
20
The categories of this paper are: acc-phys
9
The categories of this paper are: nlin
10
The categories of this paper are: q-bio
6
The categories of this paper are: astro-ph
32
The categories of this paper are: atom-ph
26
The categories of this paper are: bayes-an
28
The categories of this paper are: alg-geom
23
The categories of this paper are: solv-int