Optimal Power Allocation Using Shallow-Cut Approach Exploiting Time-Sharing Structure

This paper examines the optimal power allocation in a multiple access channel (MAC) and multi-carrier system, subject to a minimum users' rate constraint. The problem is motivated by remote rendering applications with the goal to offload computationally intensive tasks to the mobile edge devices equipped with a non-linear receiver. A shallow-cut Ellipsoid algorithm is proposed to reduce the convergence time of the employed optimization algorithm. The presented idea exploits a key structure present widely in optimization problems involving multi-carrier systems, and demonstrates significant reduction in computational time for finding the solution, with up to 50% fewer iterations. Specifically, the algorithm curtails vertex hopping by an early identification of the time-sharing structure present in a problem instantiation. The accuracy of the final solution is numerically verified.