Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/105954
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Applied Mathematics | - |
dc.creator | Lee, K | - |
dc.creator | Tang, X | - |
dc.date.accessioned | 2024-04-23T04:32:35Z | - |
dc.date.available | 2024-04-23T04:32:35Z | - |
dc.identifier.issn | 0885-7474 | - |
dc.identifier.uri | http://hdl.handle.net/10397/105954 | - |
dc.language.iso | en | en_US |
dc.publisher | Springer New York LLC | en_US |
dc.rights | © The Author(s) 2023, corrected publication 2023 | en_US |
dc.rights | This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. | en_US |
dc.rights | The following publication Lee, K., Tang, X. On the Polyhedral Homotopy Method for Solving Generalized Nash Equilibrium Problems of Polynomials. J Sci Comput 95, 13 (2023) is available at https://doi.org/10.1007/s10915-023-02138-0. | en_US |
dc.subject | Generalized Nash equilibrium problem | en_US |
dc.subject | Moment-SOS relaxation | en_US |
dc.subject | Numerical algebraic geometry | en_US |
dc.subject | Polyhedral homotopy | en_US |
dc.subject | Polynomial optimization | en_US |
dc.title | On the polyhedral homotopy method for solving generalized nash equilibrium problems of polynomials | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.volume | 95 | - |
dc.identifier.issue | 1 | - |
dc.identifier.doi | 10.1007/s10915-023-02138-0 | - |
dcterms.abstract | The generalized Nash equilibrium problem (GNEP) is a kind of game to find strategies for a group of players such that each player’s objective function is optimized. Solutions for GNEPs are called generalized Nash equilibria (GNEs). In this paper, we propose a numerical method for finding GNEs of GNEPs of polynomials based on the polyhedral homotopy continuation and the Moment-SOS hierarchy of semidefinite relaxations. We show that our method can find all GNEs if they exist, or detect the nonexistence of GNEs, under some genericity assumptions. Some numerical experiments are made to demonstrate the efficiency of our method. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Journal of scientific computing, Apr. 2023, v. 95, no. 1, 13 | - |
dcterms.isPartOf | Journal of scientific computing | - |
dcterms.issued | 2023-04 | - |
dc.identifier.scopus | 2-s2.0-85148333722 | - |
dc.identifier.eissn | 1573-7691 | - |
dc.identifier.artn | 13 | - |
dc.description.validate | 202404 bcch | - |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_Scopus/WOS | en_US |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | Hong Kong Polytechnic University | en_US |
dc.description.pubStatus | Published | en_US |
dc.description.oaCategory | CC | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
s10915-023-02138-0.pdf | 485.88 kB | Adobe PDF | View/Open |
Page views
13
Citations as of Jun 30, 2024
Downloads
3
Citations as of Jun 30, 2024
SCOPUSTM
Citations
1
Citations as of Jul 4, 2024
WEB OF SCIENCETM
Citations
1
Citations as of Jul 4, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.