A geometric branch and bound method for robust maximization of convex functions (Q2052396)
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: A geometric branch and bound method for robust maximization of convex functions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A geometric branch and bound method for robust maximization of convex functions |
scientific article |
Statements
A geometric branch and bound method for robust maximization of convex functions (English)
0 references
26 November 2021
0 references
robust optimization
0 references
maximization of convex functions
0 references
finite set of candidate functions
0 references
geometric branch and bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9094828
0 references
0.90337557
0 references
0.8947616
0 references
0.8944589
0 references
0.89060414
0 references
0.8901536
0 references
0.8896281
0 references
