Pages that link to "Item:Q2032008"
From MaRDI portal
The following pages link to Calculating radius of robust feasibility of uncertain linear conic programs via semi-definite programs (Q2032008):
Displaying 9 items.
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints (Q1785470) (← links)
- The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments (Q2242324) (← links)
- Radius of robust feasibility of system of convex inequalities with uncertain data (Q2302748) (← links)
- An exact formula for radius of robust feasibility of uncertain linear programs (Q2401515) (← links)
- Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules (Q2677664) (← links)
- On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty (Q5069193) (← links)
- Radius of Robust Feasibility for Mixed-Integer Problems (Q5084649) (← links)
- Copositive tensor optimization problem and its applications to hypergraphs (Q6189813) (← links)
- The stability of robustness for conic linear programs with uncertain data (Q6644249) (← links)