Beyond First-Order Methods for p-Structured Non-Monotone Variational Inequalities
Abstract
We propose novel high-order algorithms for a class of 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 . However, for the p-norm stationary point setting (p ≠ 2), their guarantees are limited to =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-norm stationary points for a suitable range of > 0, thereby circumventing previous fundamental challenges in p settings. We further show convergence for high-order smooth monotone operators, generalizing Adil et al. (2022) to the case where p ≥ 2, and we extend our Euclidean techniques to continuous-time settings.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.