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

半定矩阵空间上多智能体系统的一阶收敛速度方法

First-order Methods with Convergence Rates for Multi-agent Systems on Semidefinite Matrix Spaces

Nahidsadat Majlesinasab, Farzad Yousefian, Mohammad Javad Feizollahi

摘要:

本文的目标是在半定矩阵空间上发展具有收敛速度的多智能体最优化问题的一阶方法。这些问题包括合作最优化问题和非合作纳什博弈。因此,首先,我们考虑一个多智能体系统的代理合作,最小化他们的局部凸目标的总和,第二,我们考虑笛卡尔随机变分不等式(CSVI)问题的单调映射解决随机纳什博弈半定矩阵空间。尽管最近在一阶方法解决向量空间上的问题方面取得了进展,但在半定矩阵空间上的最优化问题和平衡问题的一阶方法理论中似乎存在重大差距。特别地,据我们所知,在温和的假设下,不存在具有可证明的收敛速度的方法来解决这两类问题。大多数现有的方法要么依赖于强假设,要么需要一个两循环的框架,在每个迭代的半定最优化问题需要解决。基于这一空白,在本文的第一部分中,我们提出了一种镜像下降增量次梯度法来极小化有限和函数。我们证明了该算法产生的迭代渐近收敛到最优解,并推导出非渐近收敛速度。第二部分考虑半定CSVI问题。我们开发了一个随机镜像下降方法,只需要单调的映射。我们表明,该算法产生的迭代收敛到CSVI的解决方案几乎肯定。使用适当定义的间隙函数,我们推导出一个收敛速度声明。这项工作似乎是第一个为半定矩阵空间上的单调CSVI提供收敛速度保证的工作。

英文摘要:

The goal in this paper is to develop first-order methods equipped with convergence rates for multi-agent optimization problems on semidefinite matrix spaces. These problems include cooperative optimization problems and non-cooperative Nash games. Accordingly, first we consider a multi-agent system where the agents cooperatively minimize the summation of their local convex objectives, and second, we consider Cartesian stochastic variational inequality (CSVI) problems with monotone mappings for addressing stochastic Nash games on semidefinite matrix spaces. Despite the recent advancements in first-order methods addressing problems over vector spaces, there seems to be a major gap in the theory of the first-order methods for optimization problems and equilibriums on semidefinite matrix spaces. In particular, to the best of our knowledge, there exists no method with provable convergence rate for solving the two classes of problems under mild assumptions. Most existing methods either rely on strong assumptions, or require a two-loop framework where at each iteration a semidefinite optimization problem needs to be solved. Motivated by this gap, in the first part of the paper, we develop a mirror descent incremental subgradient method for minimizing a finite-sum function. We show that the iterates generated by the algorithm converge asymptotically to an optimal solution and derive a non-asymptotic convergence rate. In the second part, we consider semidefinite CSVI problems. We develop a stochastic mirror descent method that only requires monotonicity of the mapping. We show that the iterates generated by the algorithm converge to a solution of the CSVI almost surely. Using a suitably defined gap function, we derive a convergence rate statement. This work appears to be the first that provides a convergence speed guarantee for monotone CSVIs on semidefinite matrix spaces.

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

↑