An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix.
Riley BadenbroekEtienne de KlerkPublished in: INFORMS J. Comput. (2022)
Keyphrases
- cutting plane method
- analytic center
- semidefinite
- interior point methods
- primal dual
- cutting plane
- convex optimization
- linear programming relaxation
- linear program
- feasible set
- interior point
- semidefinite programming
- linear programming
- approximation algorithms
- low rank
- convex relaxation
- version space
- sufficient conditions
- cutting plane algorithm
- convex sets
- special case
- solving problems
- convergence rate
- feasible solution
- dynamic programming