Conditional summation in GP problem

(Bassant) #1

Hi all,

I have a problem expressing the following geometric program problem, basically my problem is the interference part where i should evaluate a summation (where j !=k). I’m confused how i can write it within the body of cvx problem (after cvx_begin gp). I use SDPT3 solver.

I used (sum - beta*p(k)) as a work around but cvx gave me the following error

Thanks in advance.

the problem:

(Bassant) #2

the code:

(Bassant) #3

the error:

(Michael C. Grant) #4

Geometric programs must obey a set of rules similar to what CVX requires for disciplined convex programs. This problem does not satisfy these rules, so CVX cannot solve it.