A cutting plane algorithm for convex programming that uses analytic centers.
David S. AtkinsonPravin M. VaidyaPublished in: Math. Program. (1995)
Keyphrases
- cutting plane algorithm
- convex programming
- max flow
- linear programming
- convex optimization
- interior point methods
- integer programming
- cutting plane
- primal dual
- convex functions
- maximum margin
- semidefinite programming
- linear program
- kernel learning
- graph cuts
- feature selection
- maximum likelihood
- optimal solution
- feature extraction
- image processing