EUVIMEDEUVIMED entdecken
Crossref

Rational Generalized Nash Equilibrium Problems

Jiawang Nie, Xindong Tang, Suhan Zhong

SIAM Journal on Optimization · 30.09.2023 · 33 (3) · 1587-1620

DOI: 10.1137/21m1456285 ↗

Kurz gefasst

Fachartikel in der Zeitschrift SIAM Journal on Optimization, online erschienen am 27.07.2023. Verfasst von Jiawang Nie und 2 weiteren Autor:innen. Die Arbeit wurde bisher 13-mal zitiert (Crossref) und nennt 53 Literaturangaben. Gefördert von: National Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper studies generalized Nash equilibrium problems that are given by rational functions. The optimization problems are not assumed to be convex. Rational expressions for Lagrange multipliers and feasible extensions of KKT points are introduced to compute a generalized Nash equilibrium (GNE). We give a hierarchy of rational optimization problems to solve rational generalized Nash equilibrium problems. The existence and computation of feasible extensions are studied. The Moment-SOS relaxations are applied to solve the rational optimization problems. Under some general assumptions, we show that the proposed hierarchy can compute a GNE if it exists or detect its nonexistence. Numerical experiments are given to show the efficiency of the proposed method.

Förderung

  • National Science Foundation

Zitieren

APA

Nie, J., Tang, X., & Zhong, S. (2023). Rational Generalized Nash Equilibrium Problems. SIAM Journal on Optimization, 33(3), 1587-1620. https://doi.org/10.1137/21m1456285

Vancouver

Nie J, Tang X, Zhong S. Rational Generalized Nash Equilibrium Problems. SIAM Journal on Optimization. 2023;33(3):1587-1620. doi:10.1137/21m1456285

BibTeX
@article{Nie2023,
  author = {Nie, Jiawang and Tang, Xindong and Zhong, Suhan},
  title = {Rational Generalized Nash Equilibrium Problems},
  journal = {SIAM Journal on Optimization},
  year = {2023},
  volume = {33},
  number = {3},
  pages = {1587--1620},
  doi = {10.1137/21m1456285}
}
Kostenlos starten →