Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 10 min ago
PreprintarXiv licencearXiv

Single-call Polyak-Type Extragradient Methods for Monotone Root-Finding Problems

Abstract

We propose a single-call variant of Polyak extragradient, termed SPolyakEG, by recycling the previous extrapolation operator evaluation. Under a delayed critical condition, we establish that SPolyakEG achieves an O(1/K) residual convergence rate for monotone operators and linear convergence under strong monotonicity. Compared with PolyakEG, SPolyakEG reduces the number of operator evaluations from two to one per iteration.

Related

  1. Polyak-Type Extragradient Methods for Monotone Root-Finding Problems
    TaeHo Yoon, Sayantan Choudhury, Ezra Greenberg +1
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  2. ALDER: A Single-Loop Augmented-Lagrangian Damped Extragradient Method for Nonconvex--Concave Minimax Problems with Nonlinear Coupled Constraints
    H. Zhang, M. Zhang, Z. Xu +1
    arXivPreprintarXiv licenceFull textOptimisation & controlStatisticsarXiv
  3. Single-Loop Stochastic Projected Damped Extragradient Methods for Nonconvex--(Strongly) Concave Minimax Optimization
    Huiling Zhang, Minhao Zhang, Zi Xu +1
    arXivPreprintarXiv licenceFull textOptimisation & controlStatisticsarXiv
  4. Stochastic Linesearch Methods for Stochastic Variational Inequality Problems: Parameter-Free Schemes and Non-Monotone Variants
    Zhuoyu Xiao, Uday V. Shanbhag, Yue Xie
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. Anchored Extra-Proximal Methods: Optimal Higher-Order Methods for Monotone Inclusion Problems
    Ruichen Jiang, TaeHo Yoon
    arXivPreprintarXiv licenceFull textOptimisation & controlStatisticsarXiv
BibTeX
@misc{li2026singlecall,
  title = {{Single-call Polyak-Type Extragradient Methods for Monotone Root-Finding Problems}},
  author = {Keke Li},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.05138},
  eprint = {2610.05138},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.05138},
}
RIS
TY  - UNPB
TI  - Single-call Polyak-Type Extragradient Methods for Monotone Root-Finding Problems
AU  - Keke Li
PY  - 2026
DA  - 2026/10/04
PB  - arXiv
DO  - 10.48550/arxiv.2610.05138
UR  - https://arxiv.org/abs/2610.05138
AB  - We propose a single-call variant of Polyak extragradient, termed SPolyakEG, by recycling the previous extrapolation operator evaluation. Under a delayed critical condition, we establish that SPolyakEG achieves an O(1/K) residual convergence rate for monotone operators and linear convergence under strong monotonicity. Compared with PolyakEG, SPolyakEG reduces the number of operator evaluations from two to one per iteration.
ER  -