Login / Signup
Sdp Relaxations for Quadratic Optimization Problems Derived from Polynomial Optimization Problems.
Martin Mevissen
Masakazu Kojima
Published in:
Asia Pac. J. Oper. Res. (2010)
Keyphrases
</>
optimization problems
quadratic optimization problems
semidefinite
evolutionary algorithm
lower bound
linear programming
metaheuristic
cost function
semidefinite programming
objective function
traveling salesman problem
knapsack problem
integer programming
convex relaxation
interior point methods
low order