An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7721396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective global algorithm for worst-case linear optimization under polyhedral uncertainty |
scientific article; zbMATH DE number 7721396 |
Statements
An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (English)
0 references
2 August 2023
0 references
worst-case linear optimization
0 references
successive convex optimization
0 references
convex relaxation
0 references
branch-and-bound
0 references
computational complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8884999752044678
0 references
0.8691098690032959
0 references
0.7973498106002808
0 references
0.7259277105331421
0 references
0.721583902835846
0 references
