Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems (Q2796798): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SFSDP / rank | |||
Normal rank | |||
Revision as of 00:29, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems |
scientific article |
Statements
Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems (English)
0 references
30 March 2016
0 references
bilevel programming
0 references
global optimization
0 references
polynomial optimization
0 references
semidefinite programming hierarchies
0 references
