Pages that link to "Item:Q3169071"
From MaRDI portal
The following pages link to Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model (Q3169071):
Displaying 3 items.
- Randomized interior point methods for sampling and optimization (Q259600) (← links)
- Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization (Q463718) (← links)
- On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)