AI RESEARCH
A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition
arXiv CS.LG
•
ArXi:2504.03432v3 Announce Type: replace-cross Solving (Stampacchia) variational inequalities (SVIs) is a foundational problem at the heart of optimization. However, this expressivity comes at the cost of computational hardness. As a result, most research has focused on carving out specific subclasses that elude those intractability barriers. A classical property that goes back to the 1960s is the Minty condition, which postulates that the Minty VI (MVI) problem admits a solution.