arbiter
JournalsAccount

First-Order Methods for Stochastic Variational Inequality Problems with Function Constraints

Digvijay Boob et al.

Mathematics of Operations Research2026https://doi.org/10.1287/moor.2024.0531article
AJG 3ABDC A
Weight
0.50

Abstract

We study monotone function-constrained variational inequalities (FCVIs) whose feasible region is the intersection of a projection-friendly set and several convex function constraints; both the operator and the constraint functions may be smooth, nonsmooth, and/or stochastic. Computing the projection operator is challenging for FCVIs. We introduce the adaptive operator extrapolation (AdOpEx) method, which employs an operator extrapolation on the Karush–Kuhn–Tucker operator of the FCVI in a smooth deterministic setting. Because this operator is not uniformly Lipschitz continuous in the Lagrange multipliers, we employ an adaptive two-timescale algorithm leading to bounded multipliers and achieving the optimal [Formula: see text] convergence rate. For the nonsmooth and stochastic VIs, we introduce design changes to the AdOpEx method and propose a novel P-OpEx method that takes a partial extrapolation. It converges at the rate of [Formula: see text] when both the operator and constraints are stochastic or nonsmooth. This method has suboptimal dependence on the noise and Lipschitz constants of function constraints. We propose a constraint extrapolation approach leading to the OpConEx method that improves this dependence by an order of magnitude. All our algorithms also extend to solving saddle point problems with jointly convex function constraints that couple the primal and dual variables. Within this structured class of problems, our methods preserve their respective complexity guarantees, establishing what we believe to be the first such comprehensive complexity results. Funding: D. Boob and M. Khalafi were partially supported by the National Science Foundation [Grants 2245705 and 2340858]. D. Boob was partially supported by the Office of Naval Research [Grant N000142412749]. Q. Deng was partially supported by the National Natural Science Foundation of China [Grants 12571325 and 72394364/72394360] and the Natural Science Foundation of Shanghai [Grant 24ZR1421300].

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.1287/moor.2024.0531

Or copy a formatted citation

@article{digvijay2026,
  title        = {{First-Order Methods for Stochastic Variational Inequality Problems with Function Constraints}},
  author       = {Digvijay Boob et al.},
  journal      = {Mathematics of Operations Research},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1287/moor.2024.0531},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

First-Order Methods for Stochastic Variational Inequality Problems with Function Constraints

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.