On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game

DOI10.1007/978-3-030-77876-7_16zbMATH Open1489.90140OpenAlexW3166898200MaRDI QIDQ2117635FDOQ2117635

Yanyan Li

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-77876-7_16

zbMATH Keywords

local searchbilevel optimizationNash equilibriumreduction theorembimatrix gameexact penalization theoryglobal search theorybilevel problems with a nonconvex lower leveloptimistic solutionproblem with D.C. constraints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) 2-person games (91A05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• Numerical Optimization
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Foundations of bilevel programming
• An overview of bilevel optimization
• Global solution of bilevel programs with a nonconvex inner program
• Non-Euclidean restricted memory level method for large-scale convex optimization
• On local search in d.c. optimization problems
• Bilevel Programming Problems
• On computational search for optimistic solutions in bilevel problems
• On a global search in D.C. optimization problems
• Existence, uniqueness, and computation of robust Nash equilibria in a class of multi-leader-follower games
• Existence and generic stability of cooperative equilibria for multi-leader-multi-follower games
• Two-person nonzero-sum games and quadratic programming
• Global optimization
• On solving simple bilevel programs with a nonconvex lower level program
• On a Solving Bilevel D.C.-Convex Optimization Problems
• Numerical solution of a linear bilevel problem
• Bilevel Programming
• Numerical solution of bilinear programming problems
• Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems
• Global optimality conditions and exact penalization
• Bilevel optimization. Advances and next challenges
• Global Search for Bilevel Optimization with Quadratic Data
• On computational search for Nash equilibrium in hexamatrix games
• The local and global searches in bilevel problems with a matrix game at the lower level

Cited In (2)

• On solving simple bilevel programs with a nonconvex lower level program
• Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games

Uses Software

• PLCP
• SQPlab

This page was built for publication: On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117635)