When solving a resource optimization problem, I encountered a constraint that I felt was non concave relative to the variable I needed to optimize. Is there any method to convert this constraint into a concave constraint?

4

It looks like this has lost of bilinear terms consisting of products of various subscripts of \nu inside log2. if there is a good convex approximation to this constraint, I certainly don’t know what it would be. I don’t think CVX is an appropriate tool for this problem.