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

求解变分不等式的随机逼近算法

Solving variational inequalities with Stochastic Mirror-Prox algorithm

Anatoli Juditsky, Arkadii S. Nemirovskii, Claire Tauvel

摘要:

本文考虑随机变分不等迭代法(s.v.i.)用单调算子。我们的基本假设是算子同时具有光滑分量和非光滑分量。此外,只有噪声观测的问题数据是可用的。我们开发了一种新的随机逼近算法(SMP)解决s.v.i.并表明,与方便的步长策略,它达到了最佳的收敛速度的问题参数。我们将SMP算法应用于随机复合极小化,并描述了其在随机半定可行性问题和特征值极小化中的具体应用。

英文摘要:

In this paper we consider iterative methods for stochastic variational inequalities (s.v.i.) with monotone operators. Our basic assumption is that the operator possesses both smooth and nonsmooth components. Further, only noisy observations of the problem data are available. We develop a novel Stochastic Mirror-Prox (SMP) algorithm for solving s.v.i. and show that with the convenient stepsize strategy it attains the optimal rates of convergence with respect to the problem parameters. We apply the SMP algorithm to Stochastic composite minimization and describe particular applications to Stochastic Semidefinite Feasability problem and Eigenvalue minimization.

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

↑