Chek Beng Chua We consider two notions for the representations of convex cones: $G$-representation and lifted-$G$-representation. The former represents a convex cone as a slice of another; the latter allows in addition, the usage of auxiliary variables in the representation. We first study the basic properties of these representations. We show that some basic properties of convex cones … Read more
The notion of weighted centers is essential in V-space interior-point algorithms for linear programming. Although there were some successes in generalizing this notion to semidefinite programming via weighted center equations, we still do not have a generalization that preserves two important properties — 1) each choice of weights uniquely determines a pair of primal-dual weighted … Read more
This paper presents the new concept of second-order cone approximations for convex conic programming. Given any open convex cone $K$, a logarithmically homogeneous self-concordant barrier for $K$ and any positive real number $r \le 1$, we associate, with each direction $x \in K$, a second-order cone $\hat K_r(x)$ containing $K$. We show that $K$ is … Read more
$T$-algebras are non-associative algebras defined by Vinberg in the early 1960’s for the purpose of studying homogeneous cones. Vinberg defined a cone $K(\mathcal A)$ for each $T$-algebra $\mathcal A$ and proved that every homogeneous cone is isomorphic to one such $K(\mathcal A)$. We relate each $T$-algebra $\mathcal A$ with a space of linear operators in … Read more