Pages that link to "Item:Q4229486"
From MaRDI portal
The following pages link to Towards a Practical Volumetric Cutting Plane Method for Convex Programming (Q4229486):
Displaying 15 items.
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
- On the volumetric path (Q691484) (← links)
- Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
- On routing in VLSI design and communication networks (Q944702) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Method of simple-body centroids (Q1375256) (← links)
- The volume algorithm: Producing primal solutions with a subgradient method (Q1575065) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
- Ellipsoidal approximations of convex sets based on the volumetric barrier (Q2757590) (← links)
- A unifying framework for several cutting plane methods for semidefinite programming (Q3377972) (← links)
- On Vaidya's Volumetric Cutting Plane Method for Convex Programming (Q4339373) (← links)
- Polynomial Interior Point Cutting Plane Methods (Q4653547) (← links)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
- (Q5115786) (← links)