28 citations · 127 across the 46 of their papers we have counts for
4 papers · 1 filter
The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
Alexandros Hollender, Manolis Zampetakis
Finding approximate stationary points, i.e., points where the gradient is approximately zero, of non-convex but smooth objective functions over unrestricted -dimensional dom…
On the Complexity of Deterministic Nonsmooth and Nonconvex Optimization
Michael I. Jordan, Tianyi Lin, Manolis Zampetakis
In this paper, we present several new results on minimizing a nonsmooth and nonconvex function under a Lipschitz condition. Recent work shows that while the classical notion of Cla…
First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems
Michael I. Jordan, Tianyi Lin, Manolis Zampetakis
We consider the problem of computing an equilibrium in a class of \textit{nonlinear generalized Nash equilibrium problems (NGNEPs)} in which the strategy sets for each player are d…
Last-Iterate Convergence of Saddle-Point Optimizers via High-Resolution Differential Equations
Tatjana Chavdarova, Michael I. Jordan, Manolis Zampetakis
Several widely-used first-order saddle-point optimization methods yield an identical continuous-time ordinary differential equation (ODE) that is identical to that of the Gradient…