SOURCE-LINKED INTELLIGENCE

Polyak-Type Extragradient Methods for Monotone Root-Finding Problems

arXiv · AI, language, vision and robotics · article · Sep 22, 2026 · UTC

We study Polyak-type step-size selection for extragradient methods for solving deterministic and stochastic monotone root-finding problems. We show that the known projection-type correction for deterministic extragradient arises from minimizing an upper bound on the distance to a solution, paralleling the classical Polyak step-size construction. Using this viewpoint, we provide a unified deterministic analysis of the Polyak-type Extragradient Method (PolyakEG), based on a local critical condition controlling the variation of operator $F$ along the extrapolation direction. This analysis does no

Read original source ↗ Open in workspace

recordType

paper

region

Global