Abstract
In wireless communication and edge computing networks, fractional programming (FP) and multiplicative programming (MP) are fundamental methodologies widely employed in solving non-convex optimization problems. Prior work introduced a remarkable method to solve non-convex functions with multiple ratios by deriving novel tight upper bounds, which we formalize as the UpperBound transform in this paper. However, the UpperBound transform faces critical limitations, particularly when directly extended to MP problems involving non-negative functions or discrete optimization variables. In this paper, we introduce a generalized transform termed the UP transform to overcome these limitations.We rigorously prove that the UP transform guarantees convergence to a Karush-Kuhn-Tucker (KKT) point for a broader class of MP problems, including scenarios where variables can be zero or discrete. We comprehensively illustrate the UP transform’s utility through two practical applications: partial task offloading in mobile edge computing, optimizing computation and energy efficiency; and user association coupled with resource allocation in heterogeneous networks, addressing mixed discrete-continuous optimization challenges. Comparative evaluations against conventional methods demonstrate superior convergence speed, efficiency, solution quality, and reduced computational complexity of the proposed UP transform based algorithms.

This publication has 43 references indexed in Scilit: