On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
From MaRDI portal
Publication:2117635
DOI10.1007/978-3-030-77876-7_16zbMATH Open1489.90140OpenAlexW3166898200MaRDI QIDQ2117635FDOQ2117635
Authors: Yanyan Li 
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-77876-7_16
Recommendations
- The local and global searches in bilevel problems with a matrix game at the lower level
- On a solving bilevel d.c.-convex optimization problems
- On solving optimization problems with hidden nonconvex structures
- A global optimization method for solving convex quadratic bilevel programming problems
- Connection of some bilevel and nonlinear optimization problems
local searchbilevel optimizationNash equilibriumreduction theorembimatrix gameexact penalization theoryglobal search theorybilevel problems with a nonconvex lower leveloptimistic solutionproblem with D.C. constraints
Cites Work
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Numerical Optimization
- Title not available (Why is that?)
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Foundations of bilevel programming
- An overview of bilevel optimization
- Title not available (Why is that?)
- 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. Theory, algorithms and applications to energy networks
- On computational search for optimistic solutions in bilevel problems
- Bimatrix games and bilinear programming
- 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
- Mathematical game theory and applications
- 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
- Numerical search for the equilibria in bimatrix games
- 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 (10)
- Bilevel Nash equilibrium problems: numerical approximation via direct-search methods
- 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
- The local and global searches in bilevel problems with a matrix game at the lower level
- Piecewise affine parameterized value-function based bilevel non-cooperative games
- On solving optimization problems with hidden nonconvex structures
- A bridge between bilevel programs and Nash games
- On a solving bilevel d.c.-convex optimization problems
- Interactions between bilevel optimization and Nash games
- On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level
Uses Software
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)
