Fundamental regions of linear programming are polyhedra (since those are the objects of intersection of linear inequalities) and for semidefinite programming it is spectrahedra (https://math.berkeley.edu/~bernd/coimbra1.pdf says A spectrahedron is the intersection of the cone of positive semidefinite matrices with an affine-linear space).

What are the fundamental regions in convex programming in general?