Metraipolis › archive › dc_8447b45e1def

Averaged proximal reflected gradient method for monotone variational inequalities — arXiv:2609.06409

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.06409
License (as archived)
CC0-1.0
Archived
2026-10-16T14:24:03.525Z
SHA-256 of the archived text
9dce7d52f846619ab16ad34f445f1d49ed676386ec80240c4447beb462f239d9
Stable URL of this page
https://metraipolis.com/documento/dc_8447b45e1def

How to cite

Averaged proximal reflected gradient method for monotone variational inequalities — arXiv:2609.06409 — arXiv (en), https://arxiv.org/abs/2609.06409 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8447b45e1def (Metraipolis archive dc_8447b45e1def, sha256 9dce7d52f846619ab16ad34f445f1d49ed676386ec80240c4447beb462f239d9)
BibTeX
@misc{dc8447b45e1def,
  title = {Averaged proximal reflected gradient method for monotone variational inequalities — arXiv:2609.06409},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.06409},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8447b45e1def; sha256 9dce7d52f846619ab16ad34f445f1d49ed676386ec80240c4447beb462f239d9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06409. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Projected reflected gradient (PRG) method proposed by Malitsky is efficient for solving monotone variational inequality (MVI), while the existing upper bound of step size is not tight due to the inequality scaling in the theoretical analysis. In this paper, we construct an averaged variant of PRG method for more general MVI and present a novel Lyapunov function to establish convergent theory. This averaged PRG method provides an improvement of the golden ratio algorithm [Y, Malitsky, Math. Program., 184, 383-410, 2020], and the involved step size is compatible with that for the classical methods, such as Popov's extragradient and forward-reflected-backward methods. Moreover, a fully adaptive strategy without linesearch is presented to adjust step sizes, which generates closed-form and potentially much larger step sizes. Numerical experiments on the Nash-Cournot equilibrium, HpHard, and image reconstruction problems demonstrate that the proposed algorithm significantly outperforms existing state-of-the-art methods.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.06409 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:09:21.668Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).