Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems (Q2796798)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems |
scientific article; zbMATH DE number 6561014
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems |
scientific article; zbMATH DE number 6561014 |
Statements
30 March 2016
0 references
bilevel programming
0 references
global optimization
0 references
polynomial optimization
0 references
semidefinite programming hierarchies
0 references
0 references
0 references
0 references
0 references
0 references
0 references
Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems (English)
0 references
