EUVIMEDEUVIMED entdecken
Crossref

Solving Variational Inequalities with Stochastic Mirror-Prox Algorithm

Anatoli Juditsky, Arkadi Nemirovski, Claire Tauvel

Stochastic Systems · 2011-06 · 1 (1) · 17-58

DOI: 10.1287/10-ssy011 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Stochastic Systems, 2011-06. Verfasst von Anatoli Juditsky und 2 weiteren Autor:innen. Die Arbeit wurde bisher 216-mal zitiert (Crossref) und nennt 13 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 Feasibility problem and deterministic Eigenvalue minimization.

Zitieren

APA

Juditsky, A., Nemirovski, A., & Tauvel, C. (2011). Solving Variational Inequalities with Stochastic Mirror-Prox Algorithm. Stochastic Systems, 1(1), 17-58. https://doi.org/10.1287/10-ssy011

Vancouver

Juditsky A, Nemirovski A, Tauvel C. Solving Variational Inequalities with Stochastic Mirror-Prox Algorithm. Stochastic Systems. 2011;1(1):17-58. doi:10.1287/10-ssy011

BibTeX
@article{Juditsky2011,
  author = {Juditsky, Anatoli and Nemirovski, Arkadi and Tauvel, Claire},
  title = {Solving Variational Inequalities with Stochastic Mirror-Prox Algorithm},
  journal = {Stochastic Systems},
  year = {2011},
  volume = {1},
  number = {1},
  pages = {17--58},
  doi = {10.1287/10-ssy011}
}
Kostenlos starten →