Popov Mirror-Prox Algorithm Overview

• Popov Mirror-Prox is an extragradient method for variational inequalities that reuses past operator evaluations, reducing computational cost.
• It employs two explicit Bregman proximal steps in a mirror geometry framework to achieve an O(1/T) dual-gap rate in deterministic settings.
• Parameter-free variants adapt stepsizes for stochastic and Hölder continuous operators, enhancing practical scalability and competitiveness.

Popov Mirror-Prox is an extragradient-type algorithm for variational inequalities that combines mirror/prox geometry with a Popov-style reuse of operator information. In the mirror formulation, the method replaces the implicit update of conceptual Mirror-Prox by two explicit Bregman proximal steps, the first driven by a previously available auxiliary-point evaluation and the second driven by a fresh evaluation at the new auxiliary point. The resulting scheme is intended to retain the monotone-VI stabilization mechanism of Mirror-Prox while improving practical implementability and reducing fresh operator evaluations per loop in the deterministic setting (Chakraborty et al., 2024).

1. Variational-inequality setting

The basic problem is a variational inequality over a convex feasible set. One common formulation is to find $x^* \in X$ such that

$$\langle F(x^*),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$

with $X$ convex and compact and $F:X\to E^*$ monotone and Lipschitz in the standard monotone-VI setting (Chakraborty et al., 2024). A related formulation used in later analyses is the Minty condition

$$\langle F(x),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$

which is treated as a weak solution notion. Under monotonicity and continuity, the solution and Minty solution sets coincide in the settings considered by the cited papers (Chakraborty et al., 31 Jul 2025).

A central merit function is the dual gap

$G(x)=\max_{u\in X}\langle F(u),x-u\rangle.$

It is nonnegative, and under the monotone, continuous, compact-set assumptions used in the deterministic mirror analysis, $G(x^*)=0$ iff $x^*$ solves the VI (Chakraborty et al., 2024). In the broader stochastic and generalized-growth analysis, the operator may be written as

$F(x)=\mathbb E[\widehat F(x,\xi)],$

and the mapping variation is allowed to satisfy

$$\|F(x)-F(y)\|_* \le L_\nu \|x-y\|^\nu + M_\nu,\qquad \forall x,y\in X,$$

thereby covering Hölder continuity, Lipschitz continuity, and bounded-variation-type regimes (Chakraborty et al., 31 Jul 2025).

2. Mirror geometry and the Popov update

The mirror formulation starts from a distance-generating function $$\langle F(x^*),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$0 that is continuously differentiable and $$\langle F(x^*),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$1-strongly convex. The associated Bregman divergence is

$$\langle F(x^*),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$2

and the prox mapping is

$$\langle F(x^*),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$3

A key motivation is that the conceptual Mirror-Prox step is not practically implementable in general, because it requires finding an intermediate point satisfying an implicit condition involving $$\langle F(x^*),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$4 itself; the 2024 Popov Mirror-Prox paper explicitly identifies this as the obstacle outside special cases such as affine VIs (Chakraborty et al., 2024).

The deterministic Popov Mirror-Prox update proposed there is

$$\langle F(x^*),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$5

with output

$$\langle F(x^*),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$6

The first update uses the previous operator value $$\langle F(x^*),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$7, and the second uses the fresh value $$\langle F(x^*),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$8. The paper emphasizes that only one new operator evaluation $$\langle F(x^*),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$9 is needed per loop, since $X$0 is reused from the preceding loop (Chakraborty et al., 2024).

A later formulation writes the same deterministic recursion as

$X$1

and gives a stochastic analogue

$X$2

$X$3

together with weighted averaging

$X$4

This later presentation treats constant and diminishing step-size rules within the same Popov Mirror-Prox template (Chakraborty et al., 31 Jul 2025).

3. Relation to Mirror-Prox, extragradient, and reflected methods

Classical Mirror-Prox is a two-step extragradient method. In one representative formulation,

$X$5

$X$6

so it evaluates the operator at a prediction point and then at a corrected point, using two operator evaluations per iteration (Babanezhad et al., 2020). Popov Mirror-Prox keeps the same predictor-corrector logic in Bregman geometry but changes how past information is reused; the algorithmic novelty is not a new prox geometry, but the Popov-style reorganization of operator calls.

Within the broader extragradient family, Popov’s method is described as an improved extragradient-type method that uses only one operator evaluation per iteration in the deterministic constrained setting, and it is closely related to forward-reflected-backward (FRB) (Nguyen et al., 6 Mar 2026). In the unconstrained case $X$7, Popov becomes

$X$8

which the 2026 stepsize paper identifies with the projected reflected gradient / OGDA-type recursion in its discussion (Nguyen et al., 6 Mar 2026). This places Popov Mirror-Prox in a lineage that includes Korpelevich extragradient, Nemirovski’s Mirror-Prox, FRB, reflected-gradient methods, and optimistic updates.

A recurring misconception is that Popov Mirror-Prox is simply classical Mirror-Prox written in different notation. The cited literature indicates a sharper distinction. Conceptual Mirror-Prox can be implicit and computationally awkward outside special VI classes, whereas Popov Mirror-Prox is introduced precisely as a practical implementation based on explicit Popov updates (Chakraborty et al., 2024). Conversely, geometry-aware or universal Mirror-Prox variants retain the standard two-call extragradient template and alter the step-size mechanism instead of the extrapolation pattern; for example, Geometry-Aware Universal Mirror-Prox adapts $X$9 using Bregman divergences rather than Euclidean update norms (Babanezhad et al., 2020).

4. Convergence guarantees

For monotone $F:X\to E^*$0-Lipschitz VIs over convex compact $F:X\to E^*$1, with $F:X\to E^*$2 $F:X\to E^*$3-strongly convex, the 2024 Popov Mirror-Prox analysis proves an $F:X\to E^*$4 dual-gap rate. With

$F:X\to E^*$5

the averaged iterate

$F:X\to E^*$6

satisfies

$F:X\to E^*$7

If $F:X\to E^*$8, the additional term $F:X\to E^*$9 vanishes, so the rate matches Korpelevich mirror-prox up to constants (Chakraborty et al., 2024).

The later parameter-free analysis substantially broadens the admissible operator model. Under the polynomial-growth condition

$$\langle F(x),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$0

the paper establishes parameter-free constant and diminishing step-size schemes for stochastic and deterministic monotone VIs, and proves optimal convergence rates in terms of the dual gap function over a bounded constraint set (Chakraborty et al., 31 Jul 2025). In the stochastic monotone case, with bounded $$\langle F(x),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$1, unbiased oracle, and bounded conditional variance, constant stepsizes of the form

$$\langle F(x),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$2

yield an expected $$\langle F(x),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$3 dual-gap rate, while diminishing choices

$$\langle F(x),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$4

together with inverse-step-size averaging also recover the optimal $$\langle F(x),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$5 rate at $$\langle F(x),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$6 (Chakraborty et al., 31 Jul 2025).

For deterministic Hölder-continuous mappings with $$\langle F(x),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$7, the same paper proves a faster dual-gap rate,

$$\langle F(x),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$8

and notes that the Lipschitz case $$\langle F(x),x-x^*\rangle \ge 0,\qquad \forall x\in X,$$9 recovers $G(x)=\max_{u\in X}\langle F(u),x-u\rangle.$0 behavior. It also gives residual-function convergence without requiring bounded $G(x)=\max_{u\in X}\langle F(u),x-u\rangle.$1 or monotonicity, provided a Minty solution exists. The residual is

$G(x)=\max_{u\in X}\langle F(u),x-u\rangle.$2

and in the Lipschitz case the paper obtains an $G(x)=\max_{u\in X}\langle F(u),x-u\rangle.$3 bound on

$G(x)=\max_{u\in X}\langle F(u),x-u\rangle.$4

The paper explicitly states that knowledge of the Hölder exponent is necessary to achieve the best rates in this non-Lipschitz deterministic regime (Chakraborty et al., 31 Jul 2025).

5. Stepsize theory and sharp bounds

A separate line of work studies Popov’s algorithm itself and establishes sharp stepsize limits for generalized monotone variational inequalities. For the constrained iteration

$G(x)=\max_{u\in X}\langle F(u),x-u\rangle.$5

the universal upper bound

$G(x)=\max_{u\in X}\langle F(u),x-u\rangle.$6

is shown to be tight. The counterexample uses $G(x)=\max_{u\in X}\langle F(u),x-u\rangle.$7, $G(x)=\max_{u\in X}\langle F(u),x-u\rangle.$8, and the rotation operator

$G(x)=\max_{u\in X}\langle F(u),x-u\rangle.$9

for which $G(x^*)=0$0 and the VI has unique solution $G(x^*)=0$1. At the boundary value $G(x^*)=0$2, initialized from $G(x^*)=0$3, the iteration stays fixed away from the solution, so convergence fails exactly at the threshold (Nguyen et al., 6 Mar 2026).

The same paper distinguishes the unconstrained case $G(x^*)=0$4, where projections disappear and Popov becomes

$G(x^*)=0$5

Here the admissible bound improves to

$G(x^*)=0$6

and this upper bound is also tight (Nguyen et al., 6 Mar 2026). The analysis is based on a new Lyapunov-type quantity. With $G(x^*)=0$7,

$G(x^*)=0$8

$G(x^*)=0$9

the crucial descent inequality is

$x^*$0

Since $x^*$1 must be nonnegative, one needs $x^*$2, which yields $x^*$3 (Nguyen et al., 6 Mar 2026).

These thresholds are materially different from the standard $x^*$4 stepsize regime reviewed there for Korpelevich extragradient, Tseng’s forward-backward-forward, and related methods. A common overgeneralization is therefore to assume that all extragradient-type methods share the same maximal universal stepsize. The 2026 analysis indicates that Popov-style recursions have a distinct sharp stepsize geometry: $x^*$5 in the constrained case and $x^*$6 in the unconstrained one (Nguyen et al., 6 Mar 2026).

6. Variants, implementations, and empirical scope

The practical appeal of Popov Mirror-Prox is strongest when the prox map is easy to compute. The 2024 paper explicitly highlights affine VIs, box constraints, norm balls, and simplex constraints with an entropic mirror map as representative settings, and studies a two-player matrix game with both entropic and Euclidean choices of $x^*$7. In that experiment, sometimes the entropic mirror map performs better and sometimes the Euclidean mirror map performs better; Popov and Korpelevich mirror-prox exhibit similar empirical convergence when initialized with $x^*$8, and Popov mirror-prox is computationally less expensive because it uses only one new mapping evaluation per iteration (Chakraborty et al., 2024).

The 2025 parameter-free Popov Mirror-Prox paper validates the broader theory on noisy matrix games, piecewise quadratic functions, and image classification tasks using ResNet-18. It reports that Popov Mirror-Prox is competitive with KMP and UMP, uses fewer mapping evaluations than KMP / UMP, and that inverse-step-size averaging often performs best for PMP in the matrix-game and piecewise-quadratic tests. For MNIST, PMP is reported as competitive and slightly better than SGD on test accuracy; for CIFAR-10, Adam and AdamW outperform PMP, while PMP remains usable (Chakraborty et al., 31 Jul 2025).

Within the wider mirror-prox literature, several extensions illuminate what is specific to the Popov variant and what is orthogonal to it. Geometry-Aware Universal Mirror-Prox preserves the standard two-operator-call mirror-prox structure but adapts the step size using Bregman divergences, aiming at geometry-aware universality rather than Popov-style reuse (Babanezhad et al., 2020). “Mirror-Free Proximal Methods” extends mirror-prox to an operator-defined geometry without an explicit mirror map, retaining the two-step extragradient structure through a generalized prox operator $x^*$9 (Vyas et al., 21 Mar 2026). These developments suggest that Popov Mirror-Prox is best viewed not as a single isolated algorithm, but as one branch of a larger design space for monotone VI solvers: one axis concerns the extrapolation pattern and reuse of operator information, another concerns geometry, and a third concerns step-size adaptivity.

The current theoretical scope also has clear boundaries. Dual-gap guarantees in the parameter-free stochastic theory are stated over a bounded constraint set; the stronger deterministic Hölder rates require knowledge of the Hölder exponent; and sharp bounded-stepsize results show that Popov-type methods have nontrivial stability ceilings that cannot be enlarged as universal guarantees (Chakraborty et al., 31 Jul 2025). This supports a precise characterization: Popov Mirror-Prox is a mirror-geometric, extragradient-like, optimistic reuse method whose main strengths are implementability, evaluation economy in the deterministic formulation, and a convergence theory that now spans monotone stochastic VIs, deterministic Hölder regimes, and certain Minty-solvable non-monotone cases.