Towards a Practical Volumetric Cutting Plane Method for Convex Programming.
Kurt M. AnstreicherPublished in: SIAM J. Optim. (1998)
Keyphrases
- convex programming
- interior point methods
- cutting plane method
- convex optimization
- linear programming
- linear program
- primal dual
- semidefinite programming
- quadratic programming
- computationally intensive
- max flow
- solving problems
- semidefinite
- linear systems
- total variation
- cutting plane
- computational complexity
- special case