Reproduce “On the Role of Geometry in Solving Variational Inequalities” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Ioannis Anagnostides, Ioannis Panageas, Jingming Yan
The authors study approximate variational inequalities over norm-constrained regions, comparing how domain geometry and operator structure affect computational complexity. For affine operators, they establish polynomial-time solvability on the unit Euclidean ball, including nonsymmetric matrices, but PPAD-completeness at inverse-polynomial accuracy on each fixed rational finite ℓ_p ball with p≠2. Quadratic operators on the Euclidean ball are also PPAD-complete at inverse-polynomial accuracy.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.