Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints (Q1785470): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: YALMIP / rank | |||
Normal rank | |||
Revision as of 17:34, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints |
scientific article |
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
