DR-DAQP: A Hybrid Operator Splitting and Active-Set Solver for Affine Variational Inequalities
eess.SY, cs.MS, cs.SY
Submitted: 2026-04-02
Updated: 2026-09-18
Code: https://github.com/darnstrom/daqp
Project page: https://darnstrom.github.io/daqp/start/advanced/avi
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: We present DR-DAQP, an open-source solver for strongly monotone affine variational inequalities (AVIs) that combines Douglas-Rachford operator splitting with an active-set acceleration strategy.
Terminology
Abstract
We present DR-DAQP, an open-source solver for strongly monotone affine variational inequalities (AVIs) that combines Douglas-Rachford operator splitting with an active-set acceleration strategy. The key idea is to estimate the active set along the iterations to attempt directly computing a point that satisfies the optimality conditions. This step yields the exact AVI solution when the active set is correctly estimated, thus overcoming the asymptotic convergence limitation inherent in first-order methods. Moreover, we exploit warm-starting and pre-factorization of relevant matrices to further accelerate evaluation of the algorithm iterations. We prove convergence and establish conditions under which the algorithm terminates in finite time with the exact solution. Numerical experiments on a randomly generated set of AVIs and on a set of multi-agent optimal control problems show that DR-DAQP outperforms several state-of-the-art solvers. A high-performing C implementation is available at https://github.com/darnstrom/daqp, with easily-accessible interfaces to Julia, MATLAB, and Python.
Sources
- A Douglas-Rachford Splitting Method for Solving Monotone Variational Inequalities in Linear-quadratic Dynamic Games
- Newton Methods in Generalized Nash Equilibrium Problems with Applications to Game-Theoretic Model Predictive Control
- The explicit game-theoretic linear quadratic regulator for constrained multi-agent systems
- NashOpt - A Python Library for Computing Generalized Nash Equilibria
- Clarabel: An interior-point solver for conic programs with quadratic objectives
Related papers
- One Request, Multiple Experts: LLM Orchestrates Domain Specific Models via Adaptive Task Routing
- A Geometric Decision Procedure for STL Feasibility and Repair
- From Asymptotic to Designer-Assigned-Time Control: A Review of Stability Notions, Design Mechanisms, and Controller Architectures
- Battery Second Life: A Review of Experimental Studies
- Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems
- Policy-Level Recursive Self-Improvement for Embodied AI with a Criticality World Model