monviso: A Python Package for Solving Monotone Variational Inequalities
In this paper, we present monviso (monotone variational inequalities solver), a novel open-source Python package for solving monotone variational inequalities. We detail the package’s structure and baseline functionality, discussing a simple example that illustrates the essential methods and parameters. Moreover, we characterize how the proximal operator, which is the foundation of many iterative schemes, is handled through cvxpy, an open-source Python library for convex optimization. We list the available algorithms and describe the basic implementation of any general iterative method to enable users to build additional and (possibly new) algorithms. Finally, we illustrate several examples of possible use cases for monviso, showcasing the different applications the package can support across various fields, including control, optimization, dynamic game theory, and machine learning.
Authors
- Sergio Grammatico (ORCID: https://orcid.org/0000-0002-6021-2350)
- Mariagrazia Dotoli (ORCID: https://orcid.org/0000-0003-1459-3452)
- Peyman Mohajerin Esfahani (ORCID: https://orcid.org/0000-0003-1286-8782)
- Raffaele Carli (ORCID: https://orcid.org/0000-0001-9184-6017)
- Reza Rahimi Baghbadorani (ORCID: https://orcid.org/0000-0001-6058-2485)
- Nicola Mignoni (ORCID: https://orcid.org/0000-0002-3855-7942)
Institutions
- Dutch Network of Systems and Control (NL)
- Polytechnic University of Bari (IT)
- Delft University of Technology (NL)
Publication Details
- Published
- 2025-06-24
- DOI
- https://doi.org/10.23919/ecc65951.2025.11187100
- Primary Topic
- Assembly Line Balancing Optimization
- Type
- article
- Field-Weighted Citation Impact
- 0.00