Dears
If I have an optimization problem with n variables and m constraints that can be solved using the SOCP and SDP, how can I compare the performance of both algorithms using the Big-O notation? I know that SDP is far more complex than SOCP but I would appreciate it if you can break it down for me.