Mirror descent algorithms with productive/non-productive step switching achieve optimal convergence rates for bounded monotone operators and Lipschitz convex functional constraints in variational inequalities.
–With stopping criterion 2, we get ⟨F(x),bx−x⟩< εL F +δ+ DLF |J| |I| ∀x∈Q
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Mirror Descent-Type Algorithms for the Variational Inequality Problem with Functional Constraints
Mirror descent algorithms with productive/non-productive step switching achieve optimal convergence rates for bounded monotone operators and Lipschitz convex functional constraints in variational inequalities.