Research map / Optimization / Nonconvex and smooth optimization
First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems
Michael I. Jordan, Tianyi Lin, Manolis Zampetakis
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| solve GNEPs with first-order matrix-free algorithm instead of second-order Levenberg-Marquardt | Proposed AMP-based penalty algorithm · GNEP benchmark A.1-A.18 | solution accuracy | Mixed |
| use augmented Lagrangian variant instead of quadratic penalty | AMP-based algorithms · GNEP benchmark | numerical performance | Improved |
Closest papers by meaning
- A Direct Second-Order Method for Solving Two-Player Zero-Sum Games (ICML 2026 · similarity 0.88)
- Competitive Gradient Descent (NeurIPS 2019 · similarity 0.88)
- An Improved Quasi-Polynomial Algorithm for Approximate Well-Supported Nash Equilibria (AAAI 2019 · similarity 0.88)
- Approaching the Global Nash Equilibrium of Non-Convex Multi-Player Games (TPAMI 2024 · similarity 0.88)
- Exploitability Minimization in Games and Beyond (NeurIPS 2022 · similarity 0.87)
- The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
