Solving linear generalized Nash games using an active signature method

DOI10.1080/10556788.2025.2576221MaRDI QIDQ7357669zbMATH OpenFDO

Authors Timo Kreimeier, Andrea Walther

Publication date 25 September 2026

Published in Optimization Methods \& Software (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1080/10556788.2025.2576221

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Cites work

• A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
• Computing all solutions of linear generalized Nash equilibrium problems
• Double description method revisited
• Dynamic graph generation and dynamic rolling horizon techniques in large scale train timetabling
• Finite convergence of an active signature method to local minima of piecewise linear functions
• First- and second-order optimality conditions for piecewise smooth objective functions
• Generalized Nash equilibrium problems
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 5066291 (Why is no real title available?)
• scientific article; zbMATH DE number 3078984 (Why is no real title available?)
• Incremental convex hull algorithms are not output sensitive
• Introduction to Piecewise Differentiable Equations
• Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems
• Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
• Numerical Nonsmooth Optimization
• On first and second order optimality conditions for ABS-normal NLP
• On the solution of the KKT conditions of generalized Nash equilibrium problems
• Penalty Methods for the Solution of Generalized Nash Equilibrium Problems
• Relations between ABS-normal NLPs and MPCCs. I: Strong constraint qualifications
• Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization
• Restricted generalized Nash equilibria and controlled penalty algorithm
• Structural investigation of piecewise linearized network flow problems
• The cone condition and nonsmoothness in linear generalized Nash games

This page was built for publication: Solving linear generalized Nash games using an active signature method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7357669)