Pages that link to "Item:Q2757590"
From MaRDI portal
The following pages link to Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier (Q2757590):
Displaying 4 items.
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
- Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach (Q1433167) (← links)
- A note on approximation of a ball by polytopes (Q2386205) (← links)
- Rounding of convex sets and efficient gradient methods for linear programming problems (Q5459820) (← links)
