Pages that link to "Item:Q463718"

The following pages link to Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization (Q463718):

Displaying 6 items.

• Complexity of convex optimization using geometry-based measures and a reference point (Q1434069) (← links)
• A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
• Robust sensitivity analysis for linear programming with ellipsoidal perturbation (Q2190327) (← links)
• The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments (Q2242324) (← links)
• Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems (Q3298015) (← links)
• The Condition Number of Riemannian Approximation Problems (Q5857299) (← links)