Optimizing a polyhedral-semidefinite relaxation of completely positive programs.

Published in: Math. Program. Comput. (2010)

Keyphrases

semidefinite
convex sets
lipschitz continuity
semidefinite programming
convex relaxation
sufficient conditions
higher dimensional
interior point methods
convex optimization
finite number
primal dual
evolutionary algorithm
data points
linear program
variational inequalities
feasible set