Is SOCP harder than GP?

87 Views Asked by At

As an electrical engineer, I have been studying convex optimization for a while. During my study, I see that most textbooks claim that both second-order cone programs (SOCP) and geometric programs (GP) can be solved effectively with a modern solver. However, I cannot find any document that compares them. Hence, is SOCP harder than GP. Furthermore, is there anyway to come up with a Big O complexity to measure the difficulty of solving them in terms of the number of variables and constraints?