CAREER: Efficient Algorithms for Generalized Quasi-Variational Inequalities in Stochastic and Distributed Networks

About This Grant

This NSF CAREER project aims to develop foundational mathematical tools to address emerging challenges in distributed and uncertain systems, such as those in energy infrastructure, machine learning, and wireless communication. Despite recent advances in networked systems, current models and algorithms lack provable performance guarantees for a broad class of critical problems. These include (i) Generalized Nash games, where agents compete over shared resources; (ii) Bilevel optimization with constraints at both decision levels; and (iii) Saddle point problems with coupling constraints. Existing methods are not equipped to handle the complex, interdependent decision spaces or the uncertainty and decentralization that characterize these large-scale systems. This project addresses these gaps through a unified lens of Generalized Quasi-Variational Inequalities (GQVI), a powerful yet underdeveloped framework for capturing interdependent decisions under constraints. By improving solution methods for GQVI, the project will contribute to more reliable, efficient, and scalable decision-making tools for real-world applications. The educational plan includes engaging undergraduates in hands-on research experiences and training them to lead outreach activities in middle and high schools, featuring Python coding exercises and modules on optimization. Additionally, a virtual tour with faculty presentations and lab visits will simulate in-person field trips, aiming to inspire interest in STEM and improve engineering retention. The proposed research builds a unified theoretical and algorithmic framework for solving deterministic, stochastic, and distributed GQVI problems. The project is organized around three interconnected thrusts. First, it develops novel algorithms using operator relaxation techniques to manage the interdependencies that arise in constraint structures, providing provable convergence guarantees that overcome limitations of existing methods. Second, it reformulates nonlinear constrained GQVI problems as fixed-point problems and designs new parametric primal-dual algorithms tailored to this structure, enabling efficient and scalable solutions. Third, it addresses the complexities introduced by uncertainty and decentralization through the development of consensus-based and asynchronous methods, alongside advanced variance reduction strategies for solving large-scale stochastic and distributed settings. These innovations will deliver the first non-asymptotic convergence guarantees for GQVI problems, with broad impacts in game theory, bilevel programming, power systems, and machine learning. This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.