Decomposition methods for Network Utility Maximization (NUM)

最新推荐文章于 2023-12-26 10:20:16 发布

xiaogeseu

最新推荐文章于 2023-12-26 10:20:16 发布

阅读量441

点赞数

分类专栏： Algorithms

本文链接：https://blog.csdn.net/xiaogeseu/article/details/79078824

版权

Algorithms 专栏收录该内容

5 篇文章

订阅专栏

“Efficiently Solve” a NUM problem

1. Theoretical properties

Such as global optimality and duality gap.

Convex optimization: minimizing a convex function over a convex constraint set.
For a convex optimization, a local optimum is also a global optimum and the duality is zero under mild conditions.

2. Computational properties

To solve convex optimization, there are provably polynomial-time and practically fast and scalable (but centralized) algorithms. (e.g., interior-point methods)

3. Decomposability structures

Decomposability structures may lead to distributed (and often iterative) algorithms that converge to the global optimum.

[~] D. P. Palomar and Mung Chiang, “A tutorial on decomposition methods for network utility maximization,” in IEEE Journal on Selected Areas in Communications, vol. 24, no. 8, pp. 1439-1451, Aug. 2006.