Metraipolis › archive › dc_432620716bd2

A Parameter-Free Adaptive Reflected Gradient Method for Monotone Variational Inequalities — arXiv:2609.18355

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.18355
License (as archived)
CC0-1.0
Archived
2026-10-15T15:40:21.858Z
SHA-256 of the archived text
e6cafb86578effdd97bcc255318fd6bdf26dd656694d74adbb67b8c116abe8d4
Stable URL of this page
https://metraipolis.com/documento/dc_432620716bd2

How to cite

A Parameter-Free Adaptive Reflected Gradient Method for Monotone Variational Inequalities — arXiv:2609.18355 — arXiv (en), https://arxiv.org/abs/2609.18355 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_432620716bd2 (Metraipolis archive dc_432620716bd2, sha256 e6cafb86578effdd97bcc255318fd6bdf26dd656694d74adbb67b8c116abe8d4)
BibTeX
@misc{dc432620716bd2,
  title = {A Parameter-Free Adaptive Reflected Gradient Method for Monotone Variational Inequalities — arXiv:2609.18355},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.18355},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_432620716bd2; sha256 e6cafb86578effdd97bcc255318fd6bdf26dd656694d74adbb67b8c116abe8d4},
  year = {2026}
}

Archived text

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

We analyze a one-evaluation-per-iteration method for $\mathrm{VI}(C,B)$ with monotone $L$-Lipschitz $B$: $x_{k+1}=P_C(x_k-\lambda B(u_k))$, $u_k=x_k+\theta_k(x_k-x_{k-1})+\beta_k(x_k-u_{k-1})$, $\theta_k+\beta_k=1$. For constant step and summable filter ($\sum_k\beta_k<\infty$) we prove weak convergence via a Lyapunov function with exact rational dissipation budgets, including Malitsky's reflected gradient method. It is robust to summable operator errors; if $C$ is bounded, the constant-step range reaches $\lambda<(\sqrt2-1)/L$. For unbounded $C$ this reduces to an a priori boundedness statement, certified to $\lambda L=0.387$ by dissipation trading; for affine $B$ on polyhedral $C$, $\dist(x_n,S)\to0$ with $\sum_n\dist^2(x_n,S)<\infty$, strong convergence for bounded $C$, and $R$-linear rates after face identification. The main result is a safeguarded adaptive step-size rule needing no $L$ and no extra evaluations, proved weakly convergent unconditionally: a data-driven Lyapunov weight removes $L$ from the dissipation budgets. For affine $B$ with $C=\mathcal H$, sharpness of $\lambda L=1/\sqrt3$ via a rotation lower bound; the same constant is sharp for unconstrained nonlinear $B$, with convergence for square-summable operator values. Unconditional convergence below $1/(\sqrt3\,L)$ reduces to a marginal-pole absolute-stability statement; the projected case remains open. Under strong monotonicity we prove $R$-linear convergence with explicit contraction, and certify $\Omega(L)$ speedups over constant steps. Numerics confirm the gains.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.18355 — 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-15T15:08:22.594Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).