2 papers
math.OC2026
A Certificate of Unboundedness for Polynomial Optimization Problems
Rohan Rele, Angelia Nedich
Global polynomial optimization methods typically rely on compactness of the feasible region in order to find solutions. These methods can incur considerable computational expense a…
math.OC2025
Fast Distributed Nash Equilibrium Seeking in Monotone Games
Tatiana Tatarenko, Angelia Nedich
This work proposes a novel distributed approach for computing a Nash equilibrium in convex games with merely monotone and restricted strongly monotone pseudo-gradients. By leveragi…