Efficient Global Optimal Resource Allocation in Non-Orthogonal Interference Networks

by   Bho Matthiesen, et al.

Many resource allocation tasks are challenging global (i.e., non-convex) optimization problems. The main issue is that the computational complexity of these problems grows exponentially in the number of variables instead of polynomially as for convex optimization problems. However, often the non-convexity stems only from a subset of variables. Conventional global optimization frameworks like monotonic optimization or DC programming treat all variables as global variables and require complicated, problem specific decomposition approaches to exploit the convexity in some variables. To overcome this challenge, we develop an easy-to-use algorithm that inherently differentiates between convex and non-convex variables, preserving the polynomial complexity in the number of convex variables. Another issue with these widely used frameworks is that they may suffer from severe numerical problems. We discuss this issue in detail and provide a clear motivating example.The solution to this problem is to replace the traditional approach of finding an ϵ-approximate solution by the novel concept of ϵ-essential feasibility. The underlying algorithmic approach is called successive incumbent transcending (SIT) algorithm and builds the foundation of our developed algorithm. A further highlight of our algorithm is that it inherently treats fractional objectives making the use of Dinkelbach's iterative algorithm obsolete. Numerical experiments show a speed-up of five orders of magnitude over state-of-the-art algorithms and almost four orders of magnitude of additional speed-up over Dinkelbach's algorithm for fractional programs.



There are no comments yet.


page 1


Convex Relaxation Regression: Black-Box Optimization of Smooth Functions by Learning Their Convex Envelopes

Finding efficient and provable methods to solve non-convex optimization ...

Resource Allocation for Multi-User Downlink URLLC-OFDMA Systems

In this paper, we study resource allocation for downlink orthogonal freq...

Mixed Monotonic Programming for Fast Global Optimization

While globally optimal solutions to convex programs can be computed effi...

Geodesic Convex Optimization: Differentiation on Manifolds, Geodesics, and Convexity

Convex optimization is a vibrant and successful area due to the existenc...

Don't Give Up on Large Optimization Problems; POP Them!

Resource allocation problems in many computer systems can be formulated ...

A temporally abstracted Viterbi algorithm

Hierarchical problem abstraction, when applicable, may offer exponential...

Probable convexity and its application to Correlated Topic Models

Non-convex optimization problems often arise from probabilistic modeling...

Code Repositories


Source code for "Efficient Global Optimal Resource Allocation in Non-Orthogonal Interference Networks" by Bho Matthiesen and Eduard A. Jorswieck, submitted to IEEE Transactions on Signal Processing.

view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.