Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation.
Sourour ElloumiAmélie LambertArnaud LazarePublished in: CoRR (2019)
Keyphrases
- quadratic program
- linearly constrained
- quadratic function
- convex optimization
- convex optimization problems
- pairwise
- convex programming
- variational inequalities
- multicommodity flow problems
- constrained minimization
- polynomial equations
- quadratic optimization problems
- quadratic programming
- convex hull
- linear constraints
- neural network
- low order
- nonlinear programming
- approximation algorithms
- dynamic programming
- computational complexity
- objective function
- reinforcement learning