3 papers
math.OC2025
On iteratively regularized first-order methods for simple bilevel optimization
Sepideh Samadi, Daniel Burbano, Farzad Yousefian
We consider simple bilevel optimization (SBO) problems where the goal is to compute among the optimal solutions of a composite convex optimization problem, one that minimizes a sec…
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…