Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations.
Alain BillionnetSourour ElloumiMarie-Christine PlateauPublished in: RAIRO Oper. Res. (2008)
Keyphrases
- quadratic programming
- quadratic program
- semidefinite
- interior point methods
- linear programming
- karush kuhn tucker
- quadratically constrained quadratic
- quadratic function
- semidefinite programming
- nonlinear programming
- line search
- convex relaxation
- objective function
- support vector machine
- convex optimization
- globally optimal
- convex sets
- ls svm
- linear program
- lower bound
- data sets
- convex hull
- optimality conditions
- dynamic programming
- np hard
- reinforcement learning
- learning algorithm