Showing 2023Show all
2 papers · 1 filter
math.OC2023
Achieving optimal complexity guarantees for a class of bilevel convex optimization problems
Sepideh Samadi, Daniel Burbano, Farzad Yousefian
We design and analyze a novel accelerated gradient-based algorithm for a class of bilevel optimization problems. These problems have various applications arising from machine learn…
math.OC2023
Improved guarantees for optimal Nash equilibrium seeking and bilevel variational inequalities
Sepideh Samadi, Farzad Yousefian
We consider a class of hierarchical variational inequality (VI) problems that subsumes VI-constrained optimization and several other problem classes including the optimal solution…