Exact(60)
Otherwise, the duality gap is positive.
Sub-optimality will occur when there is a duality gap.
The duality gap is therefore null as stated in (36).
Our algorithm was able to separate many violated inequalities, reducing the duality gap.
The optimal duality gap d=0 when the primal problem is convex.
(61) Then the primal and dual pair of problems (CLFP) and (DCLFP) have no duality gap.
Null duality gap may follow from convexity, but convexity is rare in wireless communications systems.
As proved in [28], the duality gap equals to zero under some mild conditions (strong duality).
It is important to distinguish between convexity of the optimization problem and lack of duality gap.
The amount of the sub-optimality is measured by the duality gap J ¯ ∗ − U tot ∗.
This bound was computed as, where is the relative duality gap defined in (16).
Write better and faster with AI suggestions while staying true to your unique style.
Since I tried Ludwig back in 2017, I have been constantly using it in both editing and translation. Ever since, I suggest it to my translators at ProSciEditing.

Justyna Jupowicz-Kozak
CEO of Professional Science Editing for Scientists @ prosciediting.com