On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
From MaRDI portal
Publication:2117635
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
Cites work
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- scientific article; zbMATH DE number 7005721 (Why is no real title available?)
- An overview of bilevel optimization
- Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems
- Bilevel Programming
- Bilevel optimization. Advances and next challenges
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Bimatrix games and bilinear programming
- Existence and generic stability of cooperative equilibria for multi-leader-multi-follower games
- Existence, uniqueness, and computation of robust Nash equilibria in a class of multi-leader-follower games
- Foundations of bilevel programming
- Global optimality conditions and exact penalization
- Global optimization
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global search for bilevel optimization with quadratic data
- Global solution of bilevel programs with a nonconvex inner program
- Mathematical game theory and applications
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Numerical Optimization
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Numerical search for the equilibria in bimatrix games
- Numerical solution of a linear bilevel problem
- Numerical solution of bilinear programming problems
- On a global search in D.C. optimization problems
- On a solving bilevel d.c.-convex optimization problems
- On computational search for Nash equilibrium in hexamatrix games
- On computational search for optimistic solutions in bilevel problems
- On local search in d.c. optimization problems
- On solving simple bilevel programs with a nonconvex lower level program
- The local and global searches in bilevel problems with a matrix game at the lower level
- Two-person nonzero-sum games and quadratic programming
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
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)
