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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

monviso: A Python Package for Solving Monotone Variational Inequalities

Sergio Grammatico, Mariagrazia Dotoli, Peyman Mohajerin Esfahani, Raffaele Carli et al.
Assembly Line Balancing Optimization
article

monviso: A Python Package for Solving Monotone Variational Inequalities

Sergio Grammatico, Mariagrazia Dotoli, Peyman Mohajerin Esfahani, Raffaele Carli, Reza Rahimi Baghbadorani, Nicola Mignoni
article en

Abstract

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.

Dutch Network of Systems and Control (NL), Polytechnic University of Bari (IT), Delft University of Technology (NL)
Openalex Percentile: Top 59%
Assembly Line Balancing Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.