On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
type: Item
instance of: scholarly article
title: On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
zbMATH Open document ID: 1489.90140
DOI: 10.1007/978-3-030-77876-7_16
author: Yanyan Li
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 7495083
zbMATH Keywords: bilevel optimization
zbMATH Keywords: bilevel problems with a nonconvex lower level
zbMATH Keywords: optimistic solution
zbMATH Keywords: bimatrix game
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: reduction theorem
zbMATH Keywords: problem with D.C. constraints
zbMATH Keywords: global search theory
zbMATH Keywords: exact penalization theory
zbMATH Keywords: local search
describes a project that uses: SQPlab
describes a project that uses: PLCP
MaRDI profile type: Publication
full work available at URL: 978-3-030-77876-7 16
OpenAlex ID: W3166898200
cites work: Foundations of bilevel programming
cites work: Bilevel optimization. Advances and next challenges
cites work: An overview of bilevel optimization
cites work: Bilevel Programming
cites work: Bilevel Programming Problems
cites work: Q4610958
cites work: Global solution of bilevel programs with a nonconvex inner program
cites work: On solving simple bilevel programs with a nonconvex lower level program
cites work: Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems
cites work: Existence, uniqueness, and computation of robust Nash equilibria in a class of multi-leader-follower games
cites work: Existence and generic stability of cooperative equilibria for multi-leader-multi-follower games
cites work: Q3191553
cites work: Q5440984
cites work: The local and global searches in bilevel problems with a matrix game at the lower level
cites work: Global optimization
cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms
cites work: Numerical Optimization
cites work: Numerical optimization. Theoretical and practical aspects. Transl. from the French
cites work: Global optimality conditions and exact penalization
cites work: On a global search in D.C. optimization problems
cites work: Q5291097
cites work: Numerical solution of bilinear programming problems
cites work: Numerical solution of a linear bilevel problem
cites work: On computational search for optimistic solutions in bilevel problems
cites work: On computational search for Nash equilibrium in hexamatrix games
cites work: On a Solving Bilevel D.C.-Convex Optimization Problems
cites work: Global Search for Bilevel Optimization with Quadratic Data
cites work: Two-person nonzero-sum games and quadratic programming
cites work: On local search in d.c. optimization problems
cites work: Q3780016
cites work: Non-Euclidean restricted memory level method for large-scale convex optimization
description: scientific article; zbMATH DE number 7495083