Anytime Solvers for Variational Inequalities: the (Recursive) Safe Monotone Flows
Ahmed Allibhoy, Jorge Cort\'es

TL;DR
This paper develops and analyzes continuous-time dynamical systems as anytime algorithms for solving monotone variational inequalities, introducing three novel flows with stability and safety guarantees, applicable to game theory and control problems.
Contribution
It introduces three new dynamical systems for variational inequalities, including a recursive safe flow that avoids quadratic programs and guarantees stability and safety.
Findings
Safe monotone flow equilibria match critical points
Constraint set is forward invariant and asymptotically stable
Recursive safe flow ensures local exponential stability of KKT points
Abstract
This paper synthesizes anytime algorithms, in the form of continuous-time dynamical systems, to solve monotone variational inequalities. We introduce three algorithms that solve this problem: the projected monotone flow, the safe monotone flow, and the recursive safe monotone flow. The first two systems admit dual interpretations: either as projected dynamical systems or as dynamical systems controlled with a feedback controller specified by a quadratic program derived using techniques from safety-critical control. The third flow bypasses the need to solve quadratic programs along the trajectories by incorporating a dynamics whose equilibria precisely correspond to such solutions, and interconnecting the dynamical systems on different time scales. We perform a thorough analysis of the dynamical properties of all three systems. For the safe monotone flow, we show that equilibria…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Advanced Control Systems Optimization
