.png){kind=icon}
返回
Regularized Iterative Stochastic Approximation Methods for Stochastic Variational Inequality Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2012.2215413.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a Cartesian stochastic variational inequality problem with a monotone map. Monotone stochastic variational inequalities arise naturally, for instance, as the equilibrium conditions of monotone stochastic Nash games over continuous strategy sets or multiuser stochastic optimization problems. We introduce two classes of stochastic approximation methods, each of which requires exactly one projection step at every iteration, and provide convergence analysis for each of them. Of these, the first is a stochastic iterative Tikhonov regularization method which necessitates the update of the regularization parameter after every iteration. The secondmethod is a stochastic iterative proximal-point method, where the centering term is updated after every iteration. The Cartesian structure lends itself to constructing distributed multi-agent extensions and conditions are provided for recovering global convergence in limited coordination variants where agents are allowed to choose their steplength sequences, regularization and centering parameters independently, while meeting a suitable coordination requirement. We apply the proposed class of techniques and their limited coordination versions to a stochastic networked rate allocation problem.
Keyword:
Distributed algorithms
proximal-point methods
stochastic approximation
stochastic optimization
Tikhonov regularization
variational inequality
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
分享收藏分享收藏
查看更多内容