Tight Sum-of-Squares lower bounds for binary polynomial optimization problems.
Adam KurpiszSamuli LeppänenMonaldo MastrolilliPublished in: CoRR (2016)
Keyphrases
- lower bound
- optimization problems
- objective function
- upper bound
- branch and bound algorithm
- branch and bound
- evolutionary algorithm
- metaheuristic
- optimization methods
- cost function
- worst case
- optimal solution
- np hard
- average case complexity
- upper and lower bounds
- lower and upper bounds
- knapsack problem
- lower bounding
- vc dimension
- low order
- combinatorial optimization
- multi class
- sample complexity
- lagrangian relaxation
- quadratic assignment problem
- theoretical analysis
- multi objective
- optimal cost
- special case