Journal of the Operations Research Society of Japan vol. 51, no. 3, pp. 241 - 264
Second order cone program (SOCP) formulations of convex optimization problems are studied. We show that various SOCP formulations can be obtained depending on how auxiliary variables are introduced. An efficient SOCP formulation that increases the computational efficiency is presented by investigating the relationship between the sparsity of an SOCP formulation and the sparsity of the Schur complement matrix. Numerical results of selected test problems using SeDuMi and LANCELOT are included to demonstrate the performance of the SOCP formulation.