Hello Mark, apologies that was a typo, I meant DCCP (https://github.com/cvxgrp/dccp), an extension that only seems available in cvxpy at the moment for ‘difference of convex programming’.
Xiong: You may find this article I found today useful. Liang Zheng has maximised the ‘sum of weighted log (1+SINR)’ already (paper). On Fig 1 (p670), she says the above problem isn’t convex but with some assumptions can be made convex. Her MATLAB code uses cvx with a branch-and-bound algorithm.
Perhaps the method she has used is applicable to Boyd’s similar problem i.e. maximising the sum of log log (1+SINR)?