Pages that link to "Item:Q1785470"

The following pages link to Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints (Q1785470):

Displaying 15 items.

• Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
• Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
• Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs (Q1754722) (← links)
• Calculating radius of robust feasibility of uncertain linear conic programs via semi-definite programs (Q2032008) (← links)
• Robust optimization and data classification for characterization of Huntington disease onset via duality methods (Q2139276) (← 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)
• Radius of robust global error bound for piecewise linear inequality systems (Q2664894) (← links)
• A radius of robust feasibility for uncertain farthest Voronoi cells (Q2699633) (← links)
• (Q3384701) (← 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)
• A note on the radius of robust feasibility for uncertain convex programs (Q5086884) (← links)
• On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems (Q6200383) (← links)