Solving Fractional Polynomial Problems by Polynomial Optimization Theory
classification
💻 cs.IT
eess.SPmath.IT
keywords
polynomialoptimizationfppsfractionalproblemsproposedtheoryused
read the original abstract
This work aims to introduce the framework of polynomial optimization theory to solve fractional polynomial problems (FPPs). Unlike other widely used optimization frameworks, the proposed one applies to a larger class of FPPs, not necessarily defined by concave and convex functions. An iterative algorithm that is provably convergent and enjoys asymptotic optimality properties is proposed. Numerical results are used to validate its accuracy in the non-asymptotic regime when applied to the energy efficiency maximization in multiuser multiple-input multiple-output communication systems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.