arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2102.12797math.OC
收藏

基于双邻近梯度法的耦合约束复合Optimization及其在异步网络中的应用

Composite Optimization with Coupling Constraints via Dual Proximal Gradient Method with Applications to Asynchronous Networks

Jianzheng Wang, Guoqiang Hu

摘要:

本文考虑了基于近似梯度法的多智能体网络中带耦合约束的复合最优化问题。在这个问题中,所有的代理人共同最小化的光滑和可能的非光滑部分组成的各个费用函数的总和。为此,我们推导出的对偶问题的概念Fenchel共轭,从而产生了双邻近梯度算法,允许不对称的个人解释的全球约束。然后,针对具有不同步长和通信时延的异步网络,提出了一种异步双邻近梯度算法。对于这两种算法,如果目标函数的非光滑部分结构简单,则只需通过简单的操作更新对偶变量,从而降低了整体的计算复杂性。通过求解一个电力市场社会福利最优化问题的数值模拟,验证了算法的有效性。

英文摘要:

In this paper, we consider solving a composite optimization problem with coupling constraints in a multi-agent network based on proximal gradient method. In this problem, all the agents jointly minimize the sum of individual cost functions composed of smooth and possibly non-smooth parts. To this end, we derive the dual problem by the concept of Fenchel conjugate, which gives rise to the dual proximal gradient algorithm by allowing for the asymmetric individual interpretations of the global constraints. Then, an asynchronous dual proximal gradient algorithm is proposed for the asynchronous networks with heterogenous step-sizes and communication delays. For both the two algorithms, if the non-smooth parts of the objective functions are simple-structured, we only need to update dual variables by some simple operations, accounting for the reduction of the overall computational complexity. Analytical convergence rate of the proposed algorithms is derived and their efficacy is verified by solving a social welfare optimization problem of electricity market in the numerical simulation.

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

↑