English

Beyond First-Order Methods for $\ell_p$-Structured Non-Monotone Variational Inequalities

Optimization and Control 2026-03-17 v1

Abstract

We propose novel high-order algorithms for a class of p\ell_p-structured non-monotone variational inequalities. In particular, work by Diakonikolas et al. (2021), which introduced the weak Minty variational inequality (weak-MVI) setting, showed how to find an approximate first-order Euclidean stationary point for a strictly positive range of the weak-MVI parameter ρ\rho. However, for the p\ell_p-norm stationary point setting (p2p \neq 2), their guarantees are limited to ρ=0\rho=0, which recovers the standard MVI setting. In this work, we address this gap by presenting a suite of high-order methods that converge to p\ell_p-norm stationary points for a suitable range of ρ>0\rho > 0, thereby circumventing previous fundamental challenges in p\ell_p settings. We further show convergence for high-order smooth \textit{monotone} operators, generalizing Adil et al. (2022) to the case where p2p \geq 2, and we extend our Euclidean techniques to continuous-time settings.

Keywords

Cite

@article{arxiv.2603.13491,
  title  = {Beyond First-Order Methods for $\ell_p$-Structured Non-Monotone Variational Inequalities},
  author = {Abhijeet Vyas and Brian Bullins},
  journal= {arXiv preprint arXiv:2603.13491},
  year   = {2026}
}
R2 v1 2026-07-01T11:19:18.457Z