Linear and Superlinear Convergence of a Potential Reduction Algorithm for Generalized Nash Equilibrium Problems

Authors

  • Axel Dreves Author

Keywords:

Generalized Nash equilibrium problem, potential reduction algorithm, linear conver gence, superlinear convergence.

Abstract

Wepresent a detailed convergence analysis of the potential reduction algorithm for generalized Nash equilibrium problems (GNEPs), that is known to be a robust method for solving those problems. Weprove Q-linear convergence of the merit function and R-linear convergence of the distance of the iterates to the set of KKT-points of the GNEP. Furthermore, we show that the stepsize is bounded
 from below, implying finite termination of the method for prescribed accuracy. Using a non-fixed linesearch parameter we prove superlinear convergence. Further, we give additional assumptions to transfer the convergence rates to an inexact potential reduction algorithm. By our analysis, we also discover indicators that could be used to estimate the active set at an accumulation point, and hence at a generalized Nash equilibrium, which might be exploited numerically.

Downloads

Download data is not yet available.

Downloads

Published

2024-01-05

How to Cite

Linear and Superlinear Convergence of a Potential Reduction Algorithm for Generalized Nash Equilibrium Problems. (2024). Minimax Theory and Its Applications, 9(1), 55–84. https://journalmta.com/index.php/jmta/article/view/116