On Vaidya's Volumetric Cutting Plane Method for Convex Programming.

Kurt M. Anstreicher

Published in: Math. Oper. Res. (1997)

Keyphrases

convex programming
interior point methods
cutting plane method
convex optimization
linear programming
linear program
semidefinite programming
primal dual
quadratic programming
max flow
solving problems
computationally intensive
semidefinite
low rank
pairwise
linear systems
cutting plane
feature set
high dimensional