This letter aims at introducing 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/or 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 nonasymptotic regime when applied to the energy efficiency maximization in multiuser multiple-input multiple-output communication systems.

Solving Fractional Polynomial Problems by Polynomial Optimization Theory

Zappone A.;
2018-01-01

Abstract

This letter aims at introducing 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/or 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 nonasymptotic regime when applied to the energy efficiency maximization in multiuser multiple-input multiple-output communication systems.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11580/87737
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
social impact