The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Regularized Iterative Stochastic Approximation Methods for Stochastic Variational Inequality Problems
Abstract
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 second method 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Cited by
Distributed Algorithms for Aggregative Games on Graphs
Koshal, J., Nedić, A., & Shanbhag, U. V. (2016) · Operations Research · doi:10.1287/opre.2016.1501 · Cited by 341
Self-citation
Metadata
- Authors
- Koshal, J., Nedic, A., & Shanbhag, U. V.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2013-03
- Volume
- 58
- Issue
- 3
- Pages
- 594-609
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2008796819
- Cited by
- 161
- References
- 1
- FWCI
- 4.75
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Regularized Iterative Stochastic Approximation Methods for Stochastic Variational Inequality Problems. https://app.cochat.ai/papers/10.1109/tac.2012.2215413
- The paper
- Koshal, J., Nedic, A., & Shanbhag, U. V. (2013). Regularized Iterative Stochastic Approximation Methods for Stochastic Variational Inequality Problems. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2012.2215413
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.