Key points are not available for this paper at this time.
We study a special universal “conic” formulation of a convex program where the problem is in minimizing a linear objective over the intersection of a convex cone and an affine plane. We focus on the duality relations for conic problems and extend onto general conic case the primal-dual polynomial time interior point method initially developed for LP problems.
Nesterov et al. (1992) studied this question.