A First-order Method for Monotone Stochastic Variational Inequalities on Semidefinite Matrix Spaces
Nahidsadat Majlesinasab, Farzad Yousefian, and Mohammad Javad, Feizollahi

TL;DR
This paper introduces a novel first-order stochastic mirror descent method for solving monotone stochastic variational inequalities on semidefinite matrix spaces, with convergence guarantees and practical wireless network applications.
Contribution
It develops a single-loop stochastic mirror descent algorithm using quantum entropy for matrix spaces, with convergence analysis and real-world wireless network implementation.
Findings
Algorithm converges to weak solutions of SVI
Achieves a quantifiable convergence rate
Numerical experiments validate effectiveness in wireless networks
Abstract
Motivated by multi-user optimization problems and non-cooperative Nash games in stochastic regimes, we consider stochastic variational inequality (SVI) problems on matrix spaces where the variables are positive semidefinite matrices and the mapping is merely monotone. Much of the interest in the theory of variational inequality (VI) has focused on addressing VIs on vector spaces.Yet, most existing methods either rely on strong assumptions, or require a two-loop framework where at each iteration, a projection problem, i.e., a semidefinite optimization problem needs to be solved. Motivated by this gap, we develop a stochastic mirror descent method where we choose the distance generating function to be defined as the quantum entropy. This method is a single-loop first-order method in the sense that it only requires a gradient-type of update at each iteration. The novelty of this work lies…
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.
