In this paper, we propose a fast algorithm to compute a bound for the problem of optimizing the power of a number of users sharing a set of wireless channels. We define an equivalent problem and show how computing the dual function of this problem can be separated into a number of independent non-convex sub-problems in two variables only. We then give an analytic expression for the optimal value of the sub-problems so that the dual function can be evaluated in low polynomial time.