arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1005.2633math.OCcs.SYeess.SY

一种用于网络效用最大化的分布式牛顿方法

A Distributed Newton Method for Network Utility Maximization

Massachusetts Institute of Technology(麻省理工学院);University of Pennsylvania(宾夕法尼亚大学)

Ermin Wei, Asuman Ozdaglar, Ali Jadbabaie

AI总结:

针对网络效用最大化问题,提出一种基于牛顿法的分布式算法,利用矩阵分裂技术实现原对偶迭代和步长计算的分布式执行,并证明在计算误差下仍具有超线性收敛性。

摘要:

大多数现有工作使用对偶分解和次梯度方法以分布式方式求解网络效用最大化(NUM)问题,这些方法收敛速度较慢。本文开发了一种替代的分布式牛顿型快速收敛算法,用于求解具有自和谐效用函数的网络效用最大化问题。通过使用新颖的矩阵分裂技术,牛顿步的原对偶更新都可以通过迭代方案以分散方式计算,且信息交换有限。类似地,步长可以通过基于共识的迭代平均方案获得。我们表明,即使我们的方法中的牛顿方向和步长由于迭代方案的有限截断而存在一定误差,所得目标函数值仍然超线性收敛到一个明确表征的误差邻域。仿真结果表明,与基于对偶分解的现有次梯度方法相比,我们的算法在收敛速度上有显著提升。

英文摘要:

Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of convergence properties. This work develops an alternative distributed Newton-type fast converging algorithm for solving network utility maximization problems with self-concordant utility functions. By using novel matrix splitting techniques, both primal and dual updates for the Newton step can be computed using iterative schemes in a decentralized manner with limited information exchange. Similarly, the stepsize can be obtained via an iterative consensus-based averaging scheme. We show that even when the Newton direction and the stepsize in our method are computed within some error (due to finite truncation of the iterative schemes), the resulting objective function value still converges superlinearly to an explicitly characterized error neighborhood. Simulation results demonstrate significant convergence rate improvement of our algorithm relative to the existing subgradient methods based on dual decomposition.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑