Consider a convex optimization problem (call it $P$). Consider its dual (call it $D$). Is it true that the dual of $D$ is $P$?
For linear programming, it is true. I'd just like to know under which conditions hold that the dual of the dual is the primal. References would also be appreciated.
Thanks