Technical Note - A Look at Finding Points of a Convex Polyhedron Using Relaxation and Subgradient Procedures.
Gary J. KoehlerSurya KumarPublished in: Oper. Res. (1980)
Keyphrases
- np hard
- lagrangian relaxation
- convex hull
- convex optimization
- branch and bound algorithm
- convex relaxation
- linear programming
- extreme points
- feasible solution
- point sets
- data points
- computational geometry
- strictly convex
- convex concave
- convex sets
- semidefinite
- feature points
- infinite dimensional
- objective function
- discrete geometry
- semi definite programming
- feature space