Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints (Q1785470)
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 6945440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints |
scientific article; zbMATH DE number 6945440 |
Statements
Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints (English)
0 references
28 September 2018
0 references
robust optimization
0 references
convex programming
0 references
data uncertainty
0 references
radius of robust feasibility
0 references
0 references
0 references
0 references
0 references
0.9340696334838868
0 references
0.9082434177398682
0 references
0.8934313058853149
0 references
0.8770495057106018
0 references
