As part of my research, I am currently dealing with a convex program whose objective function involves the maximization of the Shannon capacity (function of power needs to optimized) subject to affine inequality constraints and a positivity constraint.
I am solving it using SeDuMi solver. That is using Successive Approximation method.
How can i know the computational complexity in terms of Big O.
Any help with this matter would be greatly appreciated!