.png){kind=icon}
返回
An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2023.3251851.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive nonasymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. The proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.
Keyword:
Computational complexity
distributed algorithms
mathematical programming
optimization methods
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
An UAV scheduling and planning method for post-disaster survey.png)
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information SciencesOAAI
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information SciencesIF0
OAAI分享收藏Introducing 2-(2-carboxyphenoxy)terephthalic acid as a new versatile building block for design of diverse coordination polymers: synthesis, structural features, luminescence sensing, and magnetismCrystEngComm
CrystEngCommIF0
PREAI
分享收藏分享收藏
查看更多内容