Comparisons of Solving Speed of QP & SOCP

319 Views Asked by At

For two same scale optimization problem, quadratic programming (QP) and second-order cone programming (SOCP), which one is faster to solve? As far as I know, the computational complexity of QP and SOCP are the same. But according to my test, the QP seems to be much faster than SOCP. What is the reason?