The local and global searches in bilevel problems with a matrix game at the lower level

DOI10.1007/978-3-030-22629-9_13zbMath1443.90284OpenAlexW2952885231MaRDI QIDQ2181756

Tatiana V. Gruzdeva, Andrey Vasil'evich Orlov

Publication date: 19 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-22629-9_13

zbMATH Keywords

local searchglobal searchbilevel optimizationmatrix gamereduction theoremglobal search theoryoptimistic solutionbilevel problems with equilibrium at the lower levelD.C. Constraint problem

Mathematics Subject Classification ID

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

Related Items (2)

Global Search for Bilevel Optimization with Quadratic Data ⋮ On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game

This page was built for publication: The local and global searches in bilevel problems with a matrix game at the lower level