Shallow, deep and very deep cuts in the analytic center cutting plane method.
Jean-Louis GoffinJean-Philippe VialPublished in: Math. Program. (1999)
Keyphrases
- cutting plane method
- analytic center
- primal dual
- interior point methods
- semidefinite
- extreme points
- linear programming
- cutting plane
- convex optimization
- feasible set
- linear program
- linear programming relaxation
- feasible solution
- interior point
- approximation algorithms
- version space
- convergence rate
- semidefinite programming
- variational inequalities
- cutting plane algorithm
- column generation
- working set
- linear systems
- valid inequalities
- convex sets
- geometric properties
- computationally intensive
- convex hull
- objective function
- higher dimensional
- active learning