“…In [84], a globally optimal algorithm, namely, the successive incumbent transcending (SIT) branch and bound (BB) algorithm was proposed to solve P 1 optimally, when the WSR, EE, and sum-power objective functions were considered. To reduce the computational complexity, a large number of works on RSMA have focused on developing suboptimal algorithms to solve P 1 , P 2 , and P 3 with affordable and tractable complexities, such as weighted minimum mean square error (WMMSE)-based algorithms [53], [58], [77], [83], [87], [90], [99], [106], [109], [119], [128], [137], successive convex approximation (SCA)based algorithms [74], [82], [89], [96], [100], [102], [104], [107], [108], [114]- [116], [122], [123], [126], [127], [135], alternating direction method of multipliers (ADMM)-based algorithms [117], [139], [140], and semidefinite relaxation (SDR)-based algorithms [73], [86], [105], [124], [125]. These algorithms are able to converge to the Karush-Kuhn-Tucker (KKT) points of the original problem.…”