Log in to save to my catalogue

Convex generalized Nash equilibrium problems and polynomial optimization

Convex generalized Nash equilibrium problems and polynomial optimization

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2788158444

Convex generalized Nash equilibrium problems and polynomial optimization

About this item

Full title

Convex generalized Nash equilibrium problems and polynomial optimization

Author / Creator

Publisher

Berlin/Heidelberg: Springer Berlin Heidelberg

Journal title

Mathematical programming, 2023-04, Vol.198 (2), p.1485-1518

Language

English

Formats

Publication information

Publisher

Berlin/Heidelberg: Springer Berlin Heidelberg

More information

Scope and Contents

Contents

This paper studies convex generalized Nash equilibrium problems that are given by polynomials. We use rational and parametric expressions for Lagrange multipliers to formulate efficient polynomial optimization for computing generalized Nash equilibria (GNEs). The Moment-SOS hierarchy of semidefinite relaxations are used to solve the polynomial opti...

Alternative Titles

Full title

Convex generalized Nash equilibrium problems and polynomial optimization

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_proquest_journals_2788158444

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2788158444

Other Identifiers

ISSN

0025-5610

E-ISSN

1436-4646

DOI

10.1007/s10107-021-01739-7

How to access this item